import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }



enum N = 28 / 2;

void main() {
  try {
    for (; ; ) {
      const M = readLong;
      auto G = new long[2*N]; foreach (i; 0 .. 2*N) G[i] = readLong;
      auto H = new long[2*N]; foreach (i; 0 .. 2*N) H[i] = readLong;
      const Q = readInt;
      auto K = new int[Q];
      auto X = new long[Q];
      foreach (q; 0 .. Q) {
        K[q] = readInt;
        X[q] = readLong;
      }
      
      long[][][2] fsss;
      foreach (h; 0 .. 2) {
        fsss[h] = new long[][N + 1];
        foreach (p; 0 .. 1 << N) {
          long f;
          foreach (i; 0 .. N) {
            f += ((p >> i & 1) ? G : H)[h * N + i];
          }
          f %= M;
          fsss[h][popcnt(p)] ~= f;
        }
        foreach (k; 0 .. N + 1) {
          fsss[h][k].sort;
        }
      }
      
      foreach (q; 0 .. Q) {
        long ans;
        foreach (k0; 0 .. N + 1) {
          const k1 = K[q] - k0;
          if (0 <= k1 && k1 <= N) {
            foreach (f; fsss[0][k0]) {
              long calc(long tar) {
                return fsss[1][k1].lowerBound(tar - f);
              }
              ans += (calc(M) - calc(X[q]));
              ans += (calc(M + M) - calc(M + X[q]));
            }
          }
        }
        writeln(ans);
      }
    }
  } catch (EOFException e) {
  }
}