#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
//#pragma warning(disable : 4996)

#ifdef _MSC_VER
#include <intrin.h>
#define __builtin_popcount __popcnt
#define __builtin_popcountll __popcnt64
#endif

#include <limits.h>
#include <math.h>
#include <time.h>

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m - 1; i >= n; --i)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define REVERSE(v, n) reverse(v, v + n);
#define VREVERSE(v) reverse(v.begin(), v.end())
#define ll long long
#define print(x) cout << (x) << '\n'
#define pe(x) cout << (x) << " "
#define DEBUG(x) cout << #x << ": " << x << endl
#define lb(v, n) lower_bound(v.begin(), v.end(), (n))
#define ub(v, n) upper_bound(v.begin(), v.end(), (n))
#define int long long
//#define double long double
#define all(x) (x).begin(), (x).end()
#define print_space(v) REP(i, v.size()) cout << v[i] << ((i == v.size() - 1) ? "\n" : " ")
template <typename T1, typename T2> inline void chmin(T1& a, T2 b) {if (a > b) a = b;}
template <typename T1, typename T2> inline void chmax(T1& a, T2 b) {if (a < b) a = b;}
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
std::random_device rd;
std::mt19937 mt(rd());
constexpr ll MOD = 1e9 + 7;
constexpr int MAX = 500050;
const double pi = acos(-1);
constexpr double EPS = 1e-8;
constexpr ll LINF = 1e18 + 1;
constexpr int INF = 1e9 + 1;
// const int dx[4] = { 0,0,-1,1 }, dy[4] = { 1,-1,0,0 };


void solve() {
	int X, K; cin >> X >> K;
	vector<int>r(K);
	REP(i, K)cin >> r[i];
	r.push_back(LINF);
	if (r[0])r.insert(r.begin(), 0);
	/*
	UB,LB -> a=X,a=0と同一視できるようになるaの境界
	hi,lo -> a=X,a=0で始めたときの値
	*/
	vector<int>hi(K + 1, X), UB(K + 1, X), LB(K + 1), lo(K + 1);
	REP(i, K) {
		int dt = r[i + 1] - r[i];
		if (i % 2 == 0) {
			hi[i + 1] = hi[i] - dt;
			UB[i + 1] = UB[i];
			lo[i + 1] = lo[i] - dt;
			LB[i + 1] = LB[i] + max<ll>(0, -lo[i + 1]);
		}
		else {
			hi[i + 1] = hi[i] + dt;
			LB[i + 1] = LB[i];
			lo[i + 1] = lo[i] + dt;
			UB[i + 1] = UB[i] - max<ll>(0, hi[i + 1] - X);
		}
		chmax(hi[i + 1], 0); chmin(hi[i + 1], X);
		chmax(lo[i + 1], 0); chmin(lo[i + 1], X);
		chmax(LB[i + 1], 0); chmin(LB[i + 1], X);
		chmax(UB[i + 1], 0); chmin(UB[i + 1], X);
	}

	int q; cin >> q;
	while (q--) {
		int t, a; cin >> t >> a;
		auto j = ub(r, t) - r.begin() - 1;
		if (a <= LB[j]) {
			a = lo[j];
		}
		else if (UB[j] <= a) {
			a = hi[j];
		}
		else {
			a = a - LB[j] + lo[j];
		}
		int dt = t - r[j];
		a = j & 1 ? min(X, a + dt) : max(0LL, a - dt);
		print(a);
	}
}

signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	 //int q;
	 //cin >> q;
	 //while (q--)
	solve();
}


Measured memory_bytes: 7064