#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint1000000007;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

int main() {
    ll M;
    cin >> M;
    const ll L = 28;
    vector<ll> G(L);
    vector<ll> H(L);
    for (ll i = 0; i < L; i++){
        cin >> G[i];
    }
    for (ll i = 0; i < L; i++){
        cin >> H[i];
    }
    ll Q;
    cin >> Q;
    vector<ll> K(Q);
    vector<ll> X(Q);
    for (ll i = 0; i < Q; i++){
        cin >> K[i] >> X[i];
    }
    vector<vector<ll>> former(L / 2 + 1, vector<ll>(0));
    for (ll i = 0; i < (1 << (L / 2)); i++){
        ll popcnt = 0;
        ll tsu = 0;
        for (ll j = 0; j < L / 2; j++){
            if ((i >> j) & 1){
                popcnt++;
                tsu = (tsu + G[j]) % M;
            }
            else{
                tsu = (tsu + H[j]) % M;
            }
        }
        former[popcnt].push_back(tsu);
    }
    vector<vector<ll>> latter(L / 2 + 1, vector<ll>(0));
    for (ll i = 0; i < (1 << (L / 2)); i++){
        ll popcnt = 0;
        ll tsu = 0;
        for (ll j = 0; j < L / 2; j++){
            if ((i >> j) & 1){
                popcnt++;
                tsu = (tsu + G[j + L / 2]) % M;
            }
            else{
                tsu = (tsu + H[j + L / 2]) % M;
            }
        }
        latter[popcnt].push_back(tsu);
    }
    for (ll i = 0; i <= L / 2; i++){
        sort(all(former[i]));
        sort(all(latter[i]));
    }
    for (ll i = 0; i < Q; i++){
        ll ans = 0;
        for (ll j = 0; j <= L / 2; j++){
            for (ll k = 0; k <= L / 2; k++){
                if (j + k != K[i]) continue;
                if (latter[k].size() == 0) continue;
                for (ll l = 0; l < former[j].size(); l++){
                    if (former[j][l] >= X[i]){
                        ll id1 = lower_bound(all(latter[k]), M - former[j][l]) - latter[k].begin();
                        ans += id1;
                        ll id2 = lower_bound(all(latter[k]), (M + X[i]) - former[j][l]) - latter[k].begin();
                        ans += (latter[k].size() - id2);
                    }
                    else{
                        ll id1 = lower_bound(all(latter[k]), X[i] - former[j][l]) - latter[k].begin();
                        ll id2 = lower_bound(all(latter[k]), M - former[j][l]) - latter[k].begin();
                        ans += (id2 - id1);
                    }
                }
            }
        }
        cout << ans << endl;
    }
}