import typing


class FenwickTree:
    '''Reference: https://en.wikipedia.org/wiki/Fenwick_tree'''

    def __init__(self, n: int = 0) -> None:
        self._n = n
        self.data = [0] * n

    def add(self, p: int, x: typing.Any) -> None:
        assert 0 <= p < self._n

        p += 1
        while p <= self._n:
            self.data[p - 1] += x
            p += p & -p

    def sum(self, left: int, right: int) -> typing.Any:
        assert 0 <= left <= right <= self._n

        return self._sum(right) - self._sum(left)

    def _sum(self, r: int) -> typing.Any:
        s = 0
        while r > 0:
            s += self.data[r - 1]
            r -= r & -r

        return s

R, N = map(int, input().split())
A = list(map(int, input().split()))
fw = FenwickTree(R)
for i in A:
	fw.add(i, 1)

for _ in range(int(input())):
	l, r = map(int, input().split())
	ans = ((r + R) // R - l // R) * N
	ans -= fw.sum(0, l % R)
	ans -= fw.sum(r % R + 1, R)
	print(ans)