#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=300005,INF=1<<30;

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    ll M;cin>>M;
    ll N=28;
    vector<ll> A(N),B(N);
    for(int i=0;i<N;i++) cin>>A[i];
    for(int i=0;i<N;i++) cin>>B[i];
    
    int Q;cin>>Q;
    while(Q--){
        ll K,X;cin>>K>>X;
        vector<vector<ll>> S(N/2+1);
        for(int bit=0;bit<(1<<(N/2));bit++){
            ll sum=0;
            for(int i=0;i<N/2;i++){
                if(bit&(1<<i)){
                    sum+=A[N/2+i];
                }else{
                    sum+=B[N/2+i];
                }
            }
            sum%=M;
            S[__builtin_popcount(bit)].push_back(sum);
        }
        for(int i=0;i<si(S);i++) sort(all(S[i]));
        
        ll ans=0;
        
        for(int bit=0;bit<(1<<(N/2));bit++){
            ll sum=0;
            for(int i=0;i<N/2;i++){
                if(bit&(1<<i)){
                    sum+=A[i];
                }else{
                    sum+=B[i];
                }
            }
            sum%=M;
            int tar=K-__builtin_popcount(bit);
            if(tar<0||tar>N/2) continue;
            
            if(sum<X){
                ll L=X-sum,R=M-sum;
                ans+=lower_bound(all(S[tar]),R)-lower_bound(all(S[tar]),L);
            }else{
                ll L=0,R=M-sum;
                ans+=lower_bound(all(S[tar]),R)-lower_bound(all(S[tar]),L);
                
                L=X+M-sum;
                R=M;
                ans+=lower_bound(all(S[tar]),R)-lower_bound(all(S[tar]),L);
            }
        }
        
        cout<<ans<<"\n";
    }
}