#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

ll L;
int N,Q;
ll A[1<<19];
ll X[1<<19];
ll D;

struct node {
	ll dif;
	ll ma,mi,up,down;
};

node merge(node a,node b) {
	node v;
	v.dif=a.dif+b.dif;
	v.ma=max(a.ma,a.dif+b.ma);
	v.mi=min(a.mi,a.dif+b.mi);
	v.up=max({a.up,b.up,b.ma+a.dif-a.mi});
	v.down=min({a.down,b.down,b.ma+a.dif-a.mi});
	return v;
}


node def;
template<class V,int NV> class SegTree_1 {
public:
	vector<V> val;
	
	SegTree_1(){val=vector<V>(NV*2,def);};
	V getval(ll x,ll y,int l=0,int r=NV,int k=1) { // x<=i<y
		//cout<<x<<" "<<y<<" "<<l<<" "<<r<<" "<<k<<endl;
		if(A[r]<=x || y<=A[l]) return def;
		if(x<=A[l] && A[r]<=y) return val[k];
		x=max(A[l],x);
		y=min(A[r],y);
		
		if(l+1==r) {
			node v;
			ll a,b;
			k-=1<<18;
			if(X[k]<X[k+1]) {
				a=X[k]+(x-A[l]);
				b=X[k+1]-(A[r]-y);
			}
			else {
				a=X[k]-(x-A[l]);
				b=X[k+1]+(A[r]-y);
			}
			v.dif=b-a;
			v.ma=v.up=max(0LL,b-a);
			v.mi=v.down=min(0LL,b-a);
			//cout<<"##"<<v.dif<<" "<<v.ma<<" "<<v.mi<<" "<<v.up<<" "<<v.down<<endl;
			return v;
		}
		
		return merge(getval(x,y,l,(l+r)/2,k*2),getval(x,y,(l+r)/2,r,k*2+1));
	}
};
SegTree_1<node,1<<18> st;


void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>L>>N>>Q;
	A[0]=0;
	FOR(i,N) {
		cin>>A[i+1];
	}
	for(i=N+1;i<1<<18+1;i++) A[i]=1LL<<53;
	for(i=1;i<1<<18;i++) {
		if(i%2==1) X[i]=X[i-1]+A[i]-A[i-1];
		else X[i]=X[i-1]-(A[i]-A[i-1]);
	}
	N+=2;
	FOR(i,N-1) {
		node& v=st.val[i+(1<<18)];
		v.dif=X[i+1]-X[i];
		if(X[i+1]>X[i]) {
			v.dif=v.ma=v.up=X[i+1]-X[i];
			v.mi=v.down=0;
		}
		else {
			v.dif=v.mi=v.down=X[i+1]-X[i];
			v.ma=v.up=0;
		}
	}
	for(i=(1<<18)-1;i>=1;i--) st.val[i]=merge(st.val[i*2],st.val[i*2+1]);
	while(Q--) {
		ll B,C;
		cin>>B>>C;
		B=(B+D)%L;
		C=(C+D)%1000000000000000LL;
		
		if(B==0) {
			D=0;
		}
		else {
			D=C+((1LL<<52)-1);
			for(i=51;i>=0;i--) {
				ll t=D-(1LL<<i);
				auto v=st.getval(C,t);
				
				//cout<<"!"<<C<<" "<<t<<" "<<v.dif<<" "<<v.ma<<" "<<v.mi<<" "<<v.up<<" "<<v.down<<endl;
				
				if(v.up>=B||v.down<=B-L) {
					D=t;
				}
			}
			D-=C;
		}
		cout<<D<<endl;
		
	}
	

}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}