#include <bits/stdc++.h>
                            #include<iostream>
                            #include<cstdio>
                            #include<vector>
                            #include<queue>
                            #include<map>
                            #include<cstring>
                            #include<string>
                            #include <math.h>
                            #include<algorithm>
                        //    #include <boost/multiprecision/cpp_int.hpp>
                            #include<functional>
                     #define int long long
                            #define inf  1000000007
                            #define pa pair<int,int>
                            #define ll long long
                            #define pal pair<double,int>
                            #define ppa pair<string,pa>
                            #define ssa pair<string,int>
                            #define  mp make_pair
                            #define  pb push_back
                            #define EPS (1e-10)
                            #define equals(a,b) (fabs((a)-(b))<EPS)
                     
                            using namespace std;
                     //priority_queue<int, vector<int>, greater<int> > que;
                            class Point{
                            	public:
                            	double x,y;
                            	Point(double x=0,double y=0):x(x),y(y) {}
                            	Point operator + (Point p) {return Point(x+p.x,y+p.y);}
                            	Point operator - (Point p) {return Point(x-p.x,y-p.y);}
                            	Point operator * (double a) {return Point(x*a,y*a);}
                            	Point operator / (double a) {return Point(x/a,y/a);}
                            	double absv() {return sqrt(norm());}
                            	double norm() {return x*x+y*y;}
                            	bool operator < (const Point &p) const{
                            		return x != p.x ? x<p.x: y<p.y;
                            	}
                            	bool operator == (const Point &p) const{
                            		return fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;
                            	}
                            };
                            typedef Point Vector;
                     
                            struct Segment{
                            Point p1,p2;
                            };
                     
                        double hen(Vector a){
                        if(fabs(a.x)<EPS && a.y>0) return acos(0);
                        else if(fabs(a.x)<EPS && a.y<0) return 3*acos(0);
                        else if(fabs(a.y)<EPS && a.x<0) return 2*acos(0);
                        else if(fabs(a.y)<EPS && a.x>0) return 0.0;
                        else if(a.y>0) return acos(a.x/a.absv());
                        else return 2*acos(0)+acos(-a.x/a.absv());
                     
                        }
                     
                string itos( int i ) {
                ostringstream s ;
                s << i ;
                return s.str() ;
                }
                 
                int gcd(int v,int b){
                	if(v>b) return gcd(b,v);
                	if(v==b) return b;
                	if(b%v==0) return v;
                	return gcd(v,b%v);
                }
                            double dot(Vector a,Vector b){
                            	return a.x*b.x+a.y*b.y;
                            }
                            double cross(Vector a,Vector b){
                            	return a.x*b.y-a.y*b.x;
                            }
                        
                double distans(double x1,double y1,double x2,double y2){
                	double rr=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
                	return sqrt(rr);
                	
                }


                         //----------------kokomade tenpure------------



int x,k,q;
int r[100020];
int e[100020][2],s[100020];
signed main(){
cin>>x>>k;
	for(int i=1;i<=k;i++) cin>>r[i];
	r[k+1]=inf;
	r[0]=0;
	e[0][0]=0,e[0][1]=x;
	s[0]=0;
	for(int i=1;i<=k;i++){
		int d=r[i]-r[i-1];
		if(i%2==1){
			if(s[i-1]>=d){
				e[i][0]=e[i-1][0];
				e[i][1]=e[i-1][1];
				s[i]=s[i-1]-d;
			}
			else if(s[i-1]+e[i-1][1]-e[i-1][0]<=d){
				s[i]=0;
				e[i][0]=0,e[i][1]=0;
			}
			else{
				e[i][0]=e[i-1][0]+d-s[i-1];
				e[i][1]=e[i-1][1];
				s[i]=0;
			}
		}
		else{
			if(s[i-1]+e[i-1][1]-e[i-1][0]<=x-d){
				e[i][0]=e[i-1][0];
				e[i][1]=e[i-1][1];
				s[i]=s[i-1]+d;
			}
			else if(s[i-1]>=x-d){
				s[i]=x;
				e[i][0]=0,e[i][1]=0;
			}
			else{
				e[i][0]=e[i-1][0];
				e[i][1]=e[i-1][1]-(d-(x-(s[i-1]+e[i-1][1]-e[i-1][0])));
				s[i]=x-(e[i][1]-e[i][0]);
			}
		}
	}
	
	
	
	cin>>q;
	for(int rt=0;rt<q;rt++){
		int t,a;
		cin>>t>>a;
		if(t==0) cout<<a<<endl;
		else{
		int* pos=lower_bound(r,r+k+2,t);
		int d=pos-r;
		d--;
		int se;
		if(e[d][0]>=a)se=s[d];
		else if(e[d][1]<=a) se=s[d]+e[d][1]-e[d][0];
		else se=s[d]+a-e[d][0];
		
		int dif=t-r[d];
		if(d%2==0) dif *= -1;
		se += dif;
		if(se<0) se=0;
		if (se>x) se=x;
		cout<<se<<endl;
		
		}
	}
	
	return 0;
}

Measured memory_bytes: 4352