#include <cstdio>

 #include <cstring>

 #include <algorithm>

 #include <map>

 using namespace std;

 typedef long long LL;

 typedef pair <LL, LL> PII;

 const int N = 5e4 + ;

 const int M = 1e5 + ;

 const int DX = ;

 int n, m;

 LL s[N], pre2[N], pre3[N], pre4[N];

 int vism[M];

 int mp[M];

 LL mm2[M], mm3[M], mm4[M];

 int len[M];

 LL nn[][N];

 int tot;

 int main(){

     scanf("%d", &n);

     for(int i = ; i <= n; ++ i){

         scanf("%lld", &s[i]);

         pre2[i] = pre2[i-] + s[i]*s[i];

         pre3[i] = pre3[i-] + s[i]*s[i]*s[i];

         pre4[i] = pre4[i-] + s[i]*s[i]*s[i]*s[i];

     }

     scanf("%d", &m);

     LL t;

     for(int i = ; i <= m; ++ i){

         scanf("%d", &len[i]);

         vism[len[i]] = ;

         for(int j = ; j < len[i]; ++ j){

             scanf("%lld", &t);

             mm2[i] += t*t;

             mm3[i] += t*t*t;

             mm4[i] += t*t*t*t;

         }

     }

     for(int i = ; i < M; ++ i){

         if(vism[i]){

             for(int j = i; j <= n; ++ j){

                 nn[tot][j-i] = (((pre4[j] - pre4[j-i]) << DX) << DX) + ((pre3[j] - pre3[j-i]) << DX) + (pre2[j] - pre2[j-i]);

             }

             sort(nn[tot], nn[tot] + n-i+);

             mp[i] = tot ++;

         }

     }

     LL tmp, p;

     for(int i = ; i <= m; ++ i){

         tmp = ((mm4[i] << DX) << DX) + (mm3[i] << DX) + mm2[i];

         p = mp[len[i]];

         printf("%d\n", upper_bound(nn[p], nn[p]+n-len[i]+, tmp) - lower_bound(nn[p], nn[p]+n-len[i]+, tmp));

     }

 }