/* -*- coding: utf-8 -*-
 *
 * 2581.cc:  No.2581 [Cherry Anniversary 3] 28輪の桜のブーケ - yukicoder
 */

#include<cstdio>
#include<vector>
#include<algorithm>
 
using namespace std;

/* constant */

const int N = 28;
const int K = N / 2;
const int KBITS = 1 << K;

/* typedef */

typedef vector<int> vi;

/* global variables */

int gs[N], hs[N];
vi bv0[K + 1], bv1[K + 1];

/* subroutines */

void addmod(int &a, int b, int m) { a = (a + b) % m; }

/* main */

int main() {
  int m;
  scanf("%d", &m);
  for (int i = 0; i < N; i++) scanf("%d", gs + i);
  for (int i = 0; i < N; i++) scanf("%d", hs + i);

  for (int bits = 0; bits < KBITS; bits++) {
    int bn = 0, s0 = 0, s1 = 0;
    for (int i = 0, bi = 1; i < K; i++, bi <<= 1) {
      bn += ((bits >> i) & 1);
      addmod(s0, (bits & bi) ? gs[i] : hs[i], m);
      addmod(s1, (bits & bi) ? gs[K + i] : hs[K + i], m);
    }

    bv0[bn].push_back(s0);
    bv1[bn].push_back(s1);
  }

  int qn;
  scanf("%d", &qn);

  while (qn--) {
    int ki, xi;
    scanf("%d%d", &ki, &xi);

    int cnt = 0;
    for (int i = 0, j = ki; j >= 0; i++, j--)
      if (i <= K && j <= K && ! bv0[i].empty() && ! bv1[j].empty())
	for (auto u: bv0[i])
	  for (auto v: bv1[j]) {
	    int s = (u + v) % m;
	    if (s >= xi) cnt++;
	  }

    printf("%d\n", cnt);
  }

  return 0;
}