/**
 *    author:  otera    
**/
#include<iostream>
#include<string> 
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm> 
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;

#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60 ;
const ll mod=1e9+7 ;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define pb push_back
#define debug(x)  cerr << #x << " = " << (x) << endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

void solve() {
	int x, k; cin >> x >> k;
    vector<int> r(k + 1, 0);
    rep(i, k) {
        cin >> r[i + 1];
    }
    int q; cin >> q;
    int maa = x, mia = 0;
    int vma = x, vmi = 0;
    int cur = 0;
    rep(i, q) {
        int t, a; cin >> t >> a;
        while(cur + 1 < k + 1 and r[cur + 1] <= t) {
            int ti = r[cur + 1] - r[cur];
            if(cur % 2 == 0) {
                //減
                if(vma - ti >= 0) {
                    vma -= ti;
                } else {
                    vma = 0;
                    vmi = 0;
                    mia = maa;
                    ++ cur;
                    continue;
                }

                if(vmi - ti >= 0) {
                    vmi -= ti;
                } else {
                    mia = mia + (ti - vmi);
                    vmi = 0;
                }
            } else {
                //増
                if(vmi + ti <= x) {
                    vmi += ti;
                } else {
                    vmi = x;
                    vma = x;
                    mia = maa;
                    ++ cur;
                    continue;
                }

                if(vma + ti <= x) {
                    vma += ti;
                } else {
                    maa = maa - (ti - (x - vma));
                    vma = x;
                }
            }
            ++ cur;
        }
        //cerr << cur << " " << maa << " " << mia << endl;
        //cerr << cur << " " << r[cur] << " " << r[cur + 1] << endl;
        if(a >= maa) {
            if(cur % 2 == 0) {
                cout << max((vma - (t - r[cur])), 0LL) << endl;
            } else {
                cout << min((vma + (t - r[cur])), x) << endl;
            }
        } else if(a <= mia) {
            if(cur % 2 == 0) {
                cout << max((vmi - (t - r[cur])), 0LL) << endl;
            } else {
                cout << min((vmi + (t - r[cur])), x) << endl;
            }
        } else {
            if(cur % 2 == 0) {
                cout << max((vmi + (a - mia) - (t - r[cur])), 0LL) << endl;
            } else {
                cout << min((vmi + (a - mia) + (t - r[cur])), x) << endl;
            }
        }
    } 
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//int t; cin >> t; rep(i, t)solve();
	solve();
    return 0;
}

Measured memory_bytes: 3960