1 #include<set>
 2 #include<cstdio>
 3 #include<algorithm>
 4 #include<iostream>
 5 #include<cstring>
 6 #include<vector>
 7 #include<queue>
 8 #include<cmath>
 9 #define INF 0x3f3f3f3f
10 #define LL long long
11 using namespace std;
12 const int MAXN = 1e3+10;
13 LL sum;
14 int mmp[MAXN][MAXN];
15 int N, M, L, Q;
16 LL sum1[MAXN], sum2[MAXN];
17 int A[MAXN];
18
19 void init()
20 {
21     memset(mmp, 0, sizeof(mmp));
22     memset(sum1, 0, sizeof(sum1));
23     memset(sum2, 0, sizeof(sum2));
24     int cnt = 0;
25     for(int i = 0; i < 4*L; i++){
26         for(int j = 0; j <= i; j++){
27             mmp[j][i-j] = A[cnt];
28             cnt = (cnt+1)%L;
29         }
30     }
31     sum = 0;
32     for(int i = 0; i < 2*L; i++){
33         for(int j = 0; j < 2*L; j++){
34             sum+=mmp[i][j];
35             sum1[i] += mmp[i][j];
36             sum2[j] += mmp[i][j];
37         }
38     }
39 }
40
41 LL query(int x, int y)
42 {
43     int cnt_x = (x+1)/(2*L);
44     int cnt_y = (y+1)/(2*L);
45     LL res = sum*cnt_x*cnt_y;
46     int lenx = (x+1)%(2*L);
47     int leny = (y+1)%(2*L);
48
49     for(int i = 0; i < lenx; i++) res+= cnt_y*sum1[i];
50     for(int j = 0; j < leny; j++) res+= cnt_x*sum2[j];
51
52
53     for(int i = 0; i < lenx; i++)
54         for(int j = 0; j < leny; j++){
55             res+=mmp[i][j];
56         }
57
58     return res;
59 }
60
61 int main()
62 {
63     int T_case;
64     int x1, x2, y1, y2;
65     scanf("%d", &T_case);
66     while(T_case--){
67         scanf("%d", &L);
68         for(int i = 0; i < L; i++){
69             scanf("%d", &A[i]);
70         }
71         init();
72
73         scanf("%d", &Q);
74         while(Q--){
75             scanf("%d %d %d %d", &x1, &y1, &x2, &y2);
76             LL ans = query(x2, y2)-query(x1-1, y2) - query(x2, y1-1) + query(x1-1, y1-1);
77             printf("%lld\n", ans);
78         }
79     }
80     return 0;
81 }