#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int mod;
  cin >> mod;
  mint::set_mod(mod);
  mint g[28][2];
  rep(i, 28) {
    int x;
    cin >> x;
    g[i][1] = x;
  }
  rep(i, 28) {
    int x;
    cin >> x;
    g[i][0] = x;
  }
  vector<int> d[15];
  rep(s, 1 << 14) {
    mint v;
    rep(i, 14) v += g[i + 14][s >> i & 1];
    d[__builtin_popcount(s)].emplace_back(v.val());
  }
  rep(i, 15) ranges::sort(d[i]);
  int q;
  cin >> q;
  rep(_, q) {
    int k, x;
    cin >> k >> x;
    int ans = 0;
    rep(s, 1 << 14) {
      mint v;
      int rest = k - __builtin_popcount(s);
      if (rest < 0 || rest >= 15) continue;
      rep(i, 14) v += g[i][s >> i & 1];
      // x <= a+b < m or x+m <= a+b < 2m
      for (auto [l, r] : {P(x - (int)v.val(), mod - (int)v.val()), P(x + mod - v.val(), 2 * mod - v.val())}) {
        ans += lower_bound(all(d[rest]), r) - lower_bound(all(d[rest]), l);
      }
    }
    cout << ans << '\n';
  }
}