#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int M;
ll G[28],H[28];
vector<ll> A[15],B[15];
int Q,K,X;

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>M;
	FOR(i,28) cin>>G[i];
	FOR(i,28) cin>>H[i];
	int mask;
	FOR(mask,1<<14) {
		ll a=0,b=0;
		x=0;
		FOR(i,14) {
			if(mask&(1<<i)) {
				a+=G[i];
				b+=G[14+i];
				x++;
			}
			else {
				a+=H[i];
				b+=H[14+i];
			}
		}
		A[x].push_back(a%M);
		B[x].push_back(b%M);
	}
	FOR(i,15) {
		sort(ALL(A[i]));
		sort(ALL(B[i]));
	}
	cin>>Q;
	while(Q--) {
		cin>>K>>X;
		ll ret=0;
		FOR(i,15) {
			k=K-i;
			if(k<0||k>14) continue;
			FORR(a,A[i]) {
				ll L,R;
				if(a<=X) {
					L=X-a;
					R=M-a;
					ret+=lower_bound(ALL(B[k]),R)-lower_bound(ALL(B[k]),L);
				}
				else {
					L=M-a;
					R=M-a+X;
					ret+=B[k].size();
					ret-=lower_bound(ALL(B[k]),R)-lower_bound(ALL(B[k]),L);
				}
			}
		}
		cout<<ret<<endl;
	}
	
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}