using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var m = NN;
        var g = NList;
        var h = NList;
        var q = NN;
        var query = NArr(q);
        var first = new List<long>[15];
        var second = new List<long>[15];
        for (var i = 0; i < 15; ++i)
        {
            first[i] = new List<long>();
            second[i] = new List<long>();
        }
        var bitmax = 1 << 14;
        for (var b = 0; b < bitmax; ++b)
        {
            var tmp = b;
            var gcnt = 0;
            var fsum = 0L;
            var ssum = 0L;
            for (var i = 0; i < 14; ++i)
            {
                if (tmp % 2 == 0)
                {
                    fsum += g[i];
                    ssum += g[i + 14];
                    ++gcnt;
                }
                else
                {
                    fsum += h[i];
                    ssum += h[i + 14];
                }
                tmp >>= 1;
            }
            first[gcnt].Add(fsum % m);
            second[gcnt].Add(ssum % m);
        }
        for (var i = 0; i < second.Length; ++i) second[i].Sort();
        var ans = new long[q];
        for (var i = 0; i < q; ++i)
        {
            var k = query[i][0];
            var x = query[i][1];
            for (var j = 0; j < first.Length; ++j)
            {
                var sg = k - j;
                if (sg < 0 || sg >= second.Length) continue;
                if (second[sg].Count == 0) continue;
                foreach (var fs in first[j])
                {
                    var add = 0;
                    if (fs <= x) add += LowerBound(0, m - fs, second[sg]) - LowerBound(0, x - fs, second[sg]);
                    else add += LowerBound(0, m - fs, second[sg]) + second[sg].Count - LowerBound(0, m + x - fs, second[sg]);
                    ans[i] += add;
                }
            }
        }
        WriteLine(string.Join("\n", ans));
    }
    // 昇順にソートされたリストの left 以降から、 min 以上の値のインデックスを取得する
    // min 以上の値がない場合 list.Length を返す(OutOfRangeに注意)
    static int LowerBound(int left, long min, List<long> list)
    {
        if (list[left] >= min) return left;
        var ng = left;
        var ok = list.Count;
        while (ok - ng > 1)
        {
            var center = (ng + ok) / 2;
            if (list[center] < min) ng = center;
            else ok = center;
        }
        return ok;
    }
}