#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
#include<complex>
using namespace std;

#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)

typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 4000001;
const double eps = 1E-18;

ll max(ll a, ll b) {
	if (a > b) { return a; }
	return b;
}

ll min(ll a, ll b) {
	if (a > b) { return b; }
	return a;
}

ll gcd(ll a, ll b) {
	if (b == 0) { return a; }
	if (a < b) { return gcd(b, a); }
	return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

struct edge {
	ll ind;
	ll fr;
	ll to;
	ll d;
};

class mint {
	long long x;
public:
	mint(long long x = 0) : x((x% MOD + MOD) % MOD) {}
	mint operator-() const {
		return mint(-x);
	}
	mint& operator+=(const mint& a) {
		if ((x += a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator-=(const mint& a) {
		if ((x += MOD - a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator*=(const  mint& a) {
		(x *= a.x) %= MOD;
		return *this;
	}
	mint operator+(const mint& a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint& a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint& a) const {
		mint res(*this);
		return res *= a;
	}

	mint operator^(const ll& t)const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}
	// for prime MOD
	mint inv() const {
		return pow(MOD - 2);
	}
	mint& operator/=(const mint& a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint& a) const {
		mint res(*this);
		return res /= a;
	}

	friend ostream& operator<<(ostream& os, const mint& m) {
		os << m.x;
		return os;
	}
};

///////////////////////////


int main() {
	ll X, K;
	cin >> X >> K;

	vector<ll> r(K + 1,0);
	repn(i, K) cin >> r[i];

	vector<ll> mx(K + 1, X), mn(K + 1, 0), imx(K + 1, X), imn(K + 1, 0);

	repn(i, K) {
		ll d = r[i] - r[i - 1];
		if (i % 2 == 0) {
			mx[i] = min(X, mx[i - 1] + d);
			mn[i] = min(X, mn[i - 1] + d);
			imn[i] = imn[i - 1];

			ll x = mx[i - 1] + d - mx[i];
			//cout << x << endl;
			imx[i] = max(imx[i - 1] - x, imn[i - 1]);
		}

		else {
			mx[i] = max(0, mx[i - 1] - d);
			mn[i] = max(0, mn[i - 1] - d);
			imx[i] = imx[i - 1];

			ll x = mn[i] - (mn[i - 1] - d);
			//cout << x << endl;
			imn[i] = min(imn[i - 1] + x, imx[i - 1]);
		}

		//cout << mx[i] << " " << mn[i] << " " << imn[i] << " " << imx[i] << endl;
	}

	ll Q;
	cin >> Q;

	repn(q, Q) {
		ll t, a;
		cin >> t >> a;
		auto itr = upper_bound(r.begin(), r.end(), t);
		ll i = distance(r.begin(), itr) - 1;

		//cout <<i<<endl;

		ll ans;
		if (a < imn[i]) { ans = mn[i]; }
		else if (a > imx[i]) { ans = mx[i]; }
		else { ans = mn[i] + (a - imn[i]); }

		if (i % 2 == 1) {
			ans += t - r[i];
			if (ans > X) { ans = X; }
		}
		else {
			ans -= t - r[i];
			if (ans < 0) { ans = 0; }
		}

		cout << ans << endl;

	}
	system("PAUSE");
}


Measured memory_bytes: 5368