#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int,int> P;
#define REP(i,n) for(ll i=0;i<ll(n);i++)


ll g[30],h[30];
vector<ll> a[20],b[20];

int main(){
	cin.tie(nullptr);  ios_base::sync_with_stdio(false);
	ll i,j;

	ll M;
	cin >> M;
	for(i=1;i<=28;i++) cin >> g[i];
	for(i=1;i<=28;i++) cin >> h[i];
	int Q;
	cin >> Q;

	for(i=0;i<(1LL<<14);i++){
		ll c=0;
		ll s=0;
		for(j=0;j<14;j++){
			if(i & (1LL<<j)){
				c++;
				s+=g[j+1];
				s%=M;
		   }else{
			    s+=h[j+1];
			    s%=M;
		   }
		}

		a[c].push_back(s);
	}

	for(i=0;i<(1LL<<14);i++){
		ll c=0;
		ll s=0;
		for(j=0;j<14;j++){
			if(i & (1LL<<j)){
				c++;
				s+=g[j+15];
				s%=M;

		   }else{
			    s+=h[j+15];
			    s%=M;

		   }
		}

		b[c].push_back(s);
	}

	REP(i,15) sort(b[i].begin(),b[i].end());


	while(Q--){

		ll K,X;
		cin >> K >> X;


		ll d=0;
		REP(i,15){
			REP(j,15){
				if((i+j)!=K) continue;

				ll n=a[i].size();
				REP(k,n){

					ll p=a[i][k];

				    ll x=lower_bound(b[j].begin(),b[j].end(),X-p)-b[j].begin();
					ll y=upper_bound(b[j].begin(),b[j].end(),M-p-1)-b[j].begin();

					ll z=lower_bound(b[j].begin(),b[j].end(),M+X-p)-b[j].begin();
					ll u=upper_bound(b[j].begin(),b[j].end(),2*M-p-1)-b[j].begin();

					d+=y-x+u-z;

				}

			}
		}

		cout << d << endl;


	}


    return 0;
}