#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;
 
#include<bits/stdc++.h>
using namespace std;
 
vector<ll> A[15];
vector<ll> B[15];
 
int main(){
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  
  int m;
  cin>>m;
  vector<ll> G(28),H(28);
  rep(i,28) cin>>G[i];
  rep(i,28) cin>>H[i];
  
  for(int bit=0;bit<(1<<14);bit++){
    int a=__builtin_popcount(bit);
    ll sum=0;
    rep(i,14){
      if(bit&(1<<i)) sum=(sum+G[i])%m;
      else sum=(sum+H[i])%m;
    }
    A[a].push_back(sum);
  }
  for(int bit=0;bit<(1<<14);bit++){
    int a=__builtin_popcount(bit);
    ll sum=0;
    rep(i,14){
      if(bit&(1<<i)) sum=(sum+G[i+14])%m;
      else sum=(sum+H[i+14])%m;
    }
    B[a].push_back(sum);
  }
  rep(i,15) sort(ALL(A[i]));
  rep(i,15) sort(ALL(B[i]));
  
  int q;
  cin>>q;
  while(q--){
    int k,x;
    cin>>k>>x;
    int ans=0;
    for(int a=0;a<=14;a++){
      if(k-a<0 || k-a>14) continue;
      for(auto p:A[a]){
        if(x>=p){
          auto q=upper_bound(ALL(B[k-a]),m-p-1)-lower_bound(ALL(B[k-a]),x-p);
          ans+=q;
        }
        else{
          auto q=upper_bound(ALL(B[k-a]),m-p-1)-B[k-a].begin();
          auto r=B[k-a].end()-lower_bound(ALL(B[k-a]),m-p+x);
          ans+=q+r;
        }
      }
    }
    cout<<ans<<endl;
  }
  
  return 0;
}