#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
int op(int a, int b) { return a + b; }
int e() { return 0; }
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int m, n; cin >> m >> n;
	vector<int>a(m);
	rep(i, n) {
		int x; cin >> x;
		a[x] = 1;
	}
	segtree<int, op, e>seg(a);
	int q; cin >> q;
	while (q--) {
		int l, r; cin >> l >> r;
		l--;
		auto f = [&](int t)->int {
			int ret = 0;
			ret += (t / m) * seg.all_prod();
			if (0 != t % m)ret += seg.prod(0, t%m + 1);
			return ret;
		};
		auto ans = f(r) - f(l);
		cout << ans << endl;
	}
	return 0;
}