#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() {cerr << '\n'; }
template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){
	cerr<<arg<<" ";Debug(rest...);}
template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {
	out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}
template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){
	out<<"("<<v.first<<", "<<v.second<<")";return out;}
const int MAX_N = 500010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = (1 << 30) - 1;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
mt19937 rng; //use it by rng() % mod, shuffle(all(vec), rng)
///////////////////////////////////////////////////////////////////////////////////////////////////

ll X;
int K;
ll R[MAX_N];
int Q;
vector<pl> query[MAX_N];
ll T[MAX_N], A[MAX_N];
ll ans[MAX_N];

vector<ll> vx;

void solve() {
	cin >> X;
	cin >> K;
	rep(i, 0, K) {
		cin >> R[i];
		vx.pb(R[i]);
	}
	cin >> Q;
	rep(i, 0, Q) {
		cin >> T[i] >> A[i];
		vx.pb(T[i]);
	}
	sort(all(vx)); vx.erase(unique(all(vx)), vx.end());

	auto fd = [&](ll a) {
		return lower_bound(all(vx), a) - vx.begin();
	};
	rep(i, 0, K) {
		int at = fd(R[i]);
		query[at].pb(pl(-1, -1));
	}
	rep(i, 0, Q) {
		int at = fd(T[i]);
		query[at].pb(pl(A[i], i));
	}

	ll tp = 0;

	ll l = 0, r = X, c = 0;
	ll s = -1;

	rep(i, 0, sz(vx)) {
		ll t = vx[i] - tp;
		tp = vx[i];

		ll d = c + r - l;
		c += t * s;
		d += t * s;

		MAX(c, 0ll); MIN(c, X);
		MAX(d, 0ll); MIN(d, X);

		if(0 < c && c < X) {
			if(d == X) r = X - c + l;
		}
		if(0 < d && d < X) {
			if(c == 0) l = r - d;
		}

		if(c == d) {
			l = 0; r = 0;
		}

		// debug(vx[i], c, d, l, r);

		rep(j, 0, sz(query[i])) {
			pl p = query[i][j];
			if(p.sec == -1) s *= -1;
			else {
				ll a = p.fst; int idx = p.sec;
				if(a < l) ans[idx] = c;
				else if(a > r) ans[idx] = d;
				else ans[idx] = c + a - l;
			}
		}
	}
	rep(i, 0, Q) {
		cout << ans[i] << "\n";
	}
}

uint32_t rd() {
	uint32_t res;
#ifdef __MINGW32__
	asm volatile("rdrand %0" :"=a"(res) ::"cc");
#else
	res = std::random_device()();
#endif
	return res;
}

int main() {
#ifndef LOCAL
	ios::sync_with_stdio(false);
    cin.tie(0);
#endif
    cout << fixed;
	cout.precision(20);
    cerr << fixed;
	cerr.precision(6);
	rng.seed(rd());
#ifdef LOCAL
	//freopen("in.txt", "wt", stdout); //for tester
	if(!freopen("in.txt", "rt", stdin)) return 1;
#endif	
	solve();
    cerr << "Time: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
	return 0;
}



Measured memory_bytes: 32368