/**
	author:  shobonvip
	created: 2024.11.16 19:35:10
**/

#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	ll r, n; cin >> r >> n;
	vector<ll> rui(r+1);
	rep(i,0,n) {
		ll a; cin >> a;
		rui[a+1] += 1;
	}
	rep(i,0,r) {
		rui[i+1] += rui[i];
	}

	auto calc = [&](ll t) -> ll {
		ll f = t / r;
		ll g = t % r;
		return f * rui[r] + rui[g];
	};

	int q; cin >> q;
	while(q--){
		ll l, r; cin >> l >> r;
		r += 1;
		cout << calc(r) - calc(l) << '\n';
	}
}