ti

#include <bits/stdc++.h>
using namespace std;
long long n,a[10010],p;
long long x(int y,int m,int d){
long long sum=(y-1)*a[n];
sum += (y-1)/4;
sum += a[m-1]+d;
return sum;
}
int main(){
freopen("ccc.in","r",stdin);
freopen("ccc.out","w",stdout);
int t;
cin >> t;
while(t--){
cin >> n;
a[0]=0;
for (long long i=1;i<=n;i++){
cin >> p;
a[i]=a[i-1]+p;
}
long long y,m,d,y2,m2,d2;
cin >> y >> m >> d >> y2 >> m2 >> d2;
cout << x(y2,m2,d2)-x(y,m,d)+1<<endl;
}
fclose(stdin);
fclose(stdout);
return 0;
}