from bisect import bisect_right,bisect_left
M = int(input())
G = list(map(int,input().split()))
H = list(map(int,input().split()))
G1 = G[:14]
G2 = G[14:]
H1 = H[:14]
H2 = H[14:]
F1 = {n:[] for n in range(14+1)}
F2 = {m:[] for m in range(14+1)}
for i in range(1<<14):
    n = 0
    f1 = 0
    f2 = 0
    for k in range(14):
        if (i>>k)&1:
            n += 1
            f1 = (f1+G1[k])%M
            f2 = (f2+G2[k])%M
        else:
            f1 = (f1+H1[k])%M
            f2 = (f2+H2[k])%M
    F1[n].append(f1)
    F2[n].append(f2)
for n in F2:
    F2[n] = sorted(F2[n])
Q = int(input())
for _ in range(Q):
    K,X = map(int,input().split())
    ans = 0
    for n in range(min(14,K)+1):
        m = K-n
        if m>14 or m<0:continue
        cnt = 0
        for a in F1[n]:
            ax = (X-a)%M
            indX = bisect_left(F2[m],ax)
            a0 = (M-1-a)%M
            ind0 = bisect_right(F2[m],a0)
            if indX>ind0:
                cnt += len(F2[m])-indX+ind0
            elif indX<ind0:
                cnt += ind0-indX
            else:
                if a0<ax:
                    cnt += len(F2[m])-indX+ind0
                else:
                    cnt += ind0-indX
        ans += cnt
    print(ans)