#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

using vi = vector<int>;

constexpr int N = 28;

void prep(int g[], int h[], int n, int m, vi b[]) {
    for (int i = 0; i < 1 << n; i++) {
        int pc = 0, cb = 0;
        for (int j = 0; j < n; j++) {
            if (i >> j & 1) {
                pc++;
                cb = (cb + g[j]) % m;
            } else {
                cb = (cb + h[j]) % m;
            }
        }

        b[pc].push_back(cb);
    }

    for (int i = 0; i <= n; i++) {
        sort(b[i].begin(), b[i].end());
    }
}

int calc(vi &a, vi &b, int l, int r) {
    int ret = 0;
    for (int i = 0, j0 = (int)b.size() - 1, j1 = (int)b.size() - 1;
         i < (int)a.size(); i++) {
        while (j0 >= 0 && a[i] + b[j0] >= l) {
            j0--;
        }
        while (j1 >= 0 && a[i] + b[j1] >= r) {
            j1--;
        }

        ret += j1 - j0;
    }

    return ret;
}

int main() {
    int m;
    cin >> m;
    int g[N], h[N];
    for (int i = 0; i < N; i++) {
        cin >> g[i];
    }
    for (int i = 0; i < N; i++) {
        cin >> h[i];
    }

    vi b0[N/2+1], b1[N/2+1];
    prep(g, h, N / 2, m, b0);
    prep(g + N / 2, h + N / 2, N / 2, m, b1);

    int q;
    cin >> q;

    while (q--) {
        int k, x;
        cin >> k >> x;

        int ans = 0;
        for (int u = 0; u <= N / 2; u++) {
            for (int v = 0; v <= N / 2; v++) {
                if (u + v == k) {
                    ans += calc(b0[u], b1[v], x, m) +
                           calc(b0[u], b1[v], x + m, 2 * m);
                }
            }
        }

        cout << ans << endl;
    }

    return 0;
}