#include<bits/stdc++.h>
//ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//clock_t start=clock();clock_t end=clock();cout<<(double)(end-start)/CLOCKS_PER_SEC<<endl;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef tuple<ll,ll,ll> tl;
typedef pair<double,double> pdd;
typedef vector<vector<ll>> mat;
ll mod=1000000007;
ll mod2=998244353;
ll mod3=1000003;
ll mod4=998244853;
ll mod5=1000000009;
ll inf=1LL<<60;
double pi=3.141592653589793238462643383279L;
double eps=1e-14;
#define rep(i,m,n) for(ll i=m;i<n;i++)
#define rrep(i,n,m) for(ll i=n;i>=m;i--)
#define srep(itr,st) for(auto itr=st.begin();itr!=st.end();itr++)
#define mrep(itr,mp) for(auto itr=mp.begin();itr!=mp.end();itr++)
#define Max(a,b) a=max(a,b)
#define Min(a,b) a=min(a,b)
int dh[4]={1,-1,0,0};
int dw[4]={0,0,1,-1};
int ddh[8]={-1,-1,-1,0,0,1,1,1};
int ddw[8]={-1,0,1,-1,1,-1,0,1};
ll gcd(ll a,ll b){
    if(a<b)swap(a,b);
    if(b==0)return a;
    if(a%b==0)return b;
    return gcd(b,a%b);
}
ll Pow(ll n,ll k){
    ll ret=1;
    ll now=n;
    while(k>0){
        if(k&1)ret*=now;
        now*=now;
        k/=2;
    }
    return ret;
}
ll beki(ll n,ll k,ll md){
  ll ret=1;
  ll now=n;
  while(k>0){
    if(k%2==1){
      ret*=now;
      ret%=md;
    }
    now*=now;
    now%=md;
    k/=2;
  }
  return ret;
}
ll gyaku(ll n,ll md){
  return beki(n,md-2,md);
}
ll popcount(ll n){
    ll ret=0;
    ll u=n;
    while(u>0){
        ret+=u%2;
        u/=2;
        
    }
    return ret;
}
int main(){
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    ll x,k;cin>>x>>k;
    vector<ll> r(k+2);
    rep(i,1,k+1)cin>>r[i];
    r[0]=0;
    r[k+1]=inf;
    pll le[k+2],ri[k+2];
    le[0]={0,0};
    ri[0]={x,x};
    rep(i,1,k+2){
        if(i%2==1){
            ll sa=r[i]-r[i-1];
            if(sa<le[i-1].second){
                le[i]={le[i-1].first,le[i-1].second-sa};
            }
            else{
                le[i]={le[i-1].first+sa-le[i-1].second,0};
            }
            ri[i]={ri[i-1].first,ri[i-1].second-sa};
            le[i].first=min(le[i].first,ri[i].first);
            ri[i].second=max(ri[i].second,le[i].second);
        }
        else{
            ll sa=r[i]-r[i-1];
            if(sa<x-ri[i-1].second){
                ri[i]={ri[i-1].first,ri[i-1].second+sa};
            }
            else{
                ri[i]={ri[i-1].first-(sa-(x-ri[i-1].second)),x};
            }
            le[i]={le[i-1].first,le[i-1].second+sa};
            ri[i].first=max(ri[i].first,le[i].first);
            le[i].second=min(le[i].second,ri[i].second);
        }
    }
    //rep(i,0,k+1)cout<<le[i].first<<" "<<le[i].second<<endl;
    int q;cin>>q;
    rep(i,0,q){
        ll t,a;cin>>t>>a;
        ll y=upper_bound(r.begin(),r.end(),t)-r.begin();
        ll now=-1;
        if(a<=le[y-1].first)now=le[y-1].second;
        else if(a<=ri[y-1].first)now=le[y-1].second+a-le[y-1].first;
        else now=ri[y-1].second;
       // cout<<now<<" "<<y<<endl;
        if(y%2==1)now-=t-r[y-1];
        else now+=t-r[y-1];
        Max(now,(ll)0);
        Min(now,x);
        cout<<now<<endl;
    }
}





Measured memory_bytes: 5120