//set many funcs
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#define inf 1145141919
#define llinf 1145141919810364364
#define mod 1000000007

int max(int a,int b){if(a>b){return a;}return b;}
int min(int a,int b){if(a<b){return a;}return b;}
int zt(int a,int b){return max(a,b)-min(a,b);}
int round(int a,int b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
int ceil(int a,int b){if(a%b==0){return a/b;}return (a/b)+1;}
int gcd(int a,int b){int c;while(b!=0){c=a%b;a=b;b=c;}return a;}
int lcm(int a,int b){int c=gcd(a,b);a/=c;return a*b;}
int nCr(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}
int fact(int a){int i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}
int pow(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}
long long llmax(long long a,long long b){if(a>b){return a;}return b;}
long long llmin(long long a,long long b){if(a<b){return a;}return b;}
long long llround(long long a,long long b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
long long llceil(long long a,long long b){if(a%b==0){return a/b;}return (a/b)+1;}
long long llgcd(long long a,long long b){long long c;while(b!=0){c=a%b;a=b;b=c;}return a;}
long long lllcm(long long a,long long b){long long c=llgcd(a,b);a/=c;return a*b;}
long long llnCr(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}
long long llfact(long long a){long long i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}
long long llpow(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}
double dbmax(double a,double b){if(a>b){return a;}return b;}
double dbmin(double a,double b){if(a<b){return a;}return b;}
int sortfncsj(const void *a,const void *b){if(*(int *)a>*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}
int sortfnckj(const void *a,const void *b){if(*(int *)a<*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}
int llsortfncsj(const void *a,const void *b){if(*(long long *)a>*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;}
int llsortfnckj(const void *a,const void *b){if(*(long long *)a<*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;}
int dbsortfncsj(const void *a,const void *b){if(*(double *)a>*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;}
int dbsortfnckj(const void *a,const void *b){if(*(double *)a<*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;}

int main(void){
    int x,n,i,a[131072]={0},qk,qt,qa,bz=0,bx,zf,xf,ap,kc;
    scanf("%d%d",&x,&n);bx=x;
    for(i = 1;i <= n;i++){scanf("%d",&a[i]);}
    ap=1;
    scanf("%d",&qk);
    scanf("%d%d",&qt,&qa);qk--;
    zf=0;xf=x;
    while(qk>0){
        if(qt>=a[ap]){
            kc=a[ap]-a[ap-1];
            if(ap%2==1){
                bz=max(bz,min(bx,kc));
                zf=max(0,zf-kc);
                xf=max(0,xf-kc);
            }
            else{
                bx=min(bx,max(bz,x-kc));
                zf=min(x,zf+kc);
                xf=min(x,xf+kc);
            }
            ap++;
        }
       else{
            if(ap%2==1){
            if(qa<=bz){printf("%d\n",max(0,zf-(qt-a[ap])));}
            else if(qa>=bx){printf("%d\n",max(0,xf-(qt-a[ap])));}
            }
            else{printf("%d\n",max(0,qa-(qt-a[ap])));}
            else{
            if(qa<=bz){printf("%d\n",min(x,zf+(qt-a[ap])));}
            else if(qa>=bx){printf("%d\n",min(x,xf+(qt-a[ap])));}
            }
            else{printf("%d\n",min(0,(qa-bz)+(qt-a[ap])));}
            }
            scanf("%d%d",&qt,&qa);qk--;
        }
    }
    return 0;
}