#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iterator>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <utility>
#include <memory>
#include <functional>
#include <deque>
#include <cctype>
#include <ctime>
#include <numeric>
#include <list>
#include <iomanip>

#if __cplusplus >= 201103L
#include <array>
#include <tuple>
#include <initializer_list>
#include <forward_list>

#define cauto const auto&
#else

#endif

using namespace std;


typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll;
typedef vector<vector<long long> > vvll;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
    v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
    stringstream ss;
    ss << f;
    ss >> t;
}

#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define _rep(i,n) _rep2((i),0,(n))
#define _rep2(i,a,b) for(int i=(a);i<(b);++i)
#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define fi first
#define se second
#define mkp make_pair
#define DEBUG
#ifdef DEBUG
#define dump(x)  cout << #x << " = " << (x) << endl;
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#else
#define dump(x) 
#define debug(x) 
#endif

#define MOD 1000000007LL
#define EPS 1e-8
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
#define maxs(x,y) x=max(x,y)
#define mins(x,y) x=min(x,y)

void mainmain(){
	ll X;
	cin>>X;
	int K;
	cin>>K;
	vll r(K);
	rep(i,K) cin>>r[i];

	vll a(K+1);
	vll b(K+1);
	vll c(K+1);
	int pre = 0;
	b[0] = X;
	rep(i,K){
		int dif = r[i] - pre;
		pre = r[i];
		if(i&1){
			if(a[i]+c[i]+dif>=X){
				a[i+1] = 0;
				b[i+1] = 0;
				c[i+1] = X;
			}
			else if(b[i]+c[i]+dif<X){
				c[i+1] = c[i]+dif;
				a[i+1] = a[i];
				b[i+1] = b[i];
			}
			else{
				a[i+1] = a[i];
				b[i+1] = -c[i]-dif+X;
				c[i+1] = X-b[i+1];
				// cout<<i<<" "<<"hoge"<<endl;
			}
		}
		else{
			if(b[i]+c[i]-dif<=0){
				a[i+1] = 0;
				b[i+1] = 0;
				c[i+1] = 0;
			}
			else if(a[i]+c[i]-dif>0){
				c[i+1] = c[i]-dif;
				a[i+1] = a[i];
				b[i+1] = b[i];
			}
			else{
				a[i+1] = -c[i]+dif;
				b[i+1] = b[i];
				c[i+1] = -a[i+1];
			}
		}
		// cout<<dif<<" "<<a[i+1]<<" "<<b[i+1]<<" "<<c[i+1]<<endl;
	}

	int Q;
	cin>>Q;
	vll sum(K+1);
	rep(i,1,K+1){
		sum[i] = r[i-1];
		// cout<<sum[i]<<" ";
	}
	// cout<<endl;
	rep(_, Q){
		ll t,A;
		cin>>t>>A;
		int idx = upper_bound(ALL(sum), t)-sum.begin()-1;
		int dif = t-sum[idx];
		// cout<<"sum "<<" "<<sum[idx]<<endl;
		ll ans;
		// cout<<a[idx]<<" "<<b[idx]<<" "<<c[idx]<<" "<<idx<<" "<<dif<<endl;
		if(A>b[idx]) ans = b[idx]+c[idx];
		else if(a[idx]<=A && A<=b[idx]) ans = A+c[idx];
		else ans = a[idx]+c[idx];
		if(idx&1){
			ans = min(ans+dif, X);
		}
		else{
			ans = max(ans-dif, 0LL);
		}
		cout<<ans<<endl;
	}
}


signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout<<fixed<<setprecision(20);
    mainmain();
}

Measured memory_bytes: 5120