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

#undef _P
#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 ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

int N,K1,K2,M;
int order[101010];
int X[101010],Y[101010];

set<pair<int,int>> A;
set<pair<int,int>> B;
set<pair<int,int>> ev;
int ret[101010];

void fix(int x) {
	if(x<1 || x>N) return;
	if(A.count({order[x],x})==0 && B.count({order[x],x})==0) return;
	int nei=0;
	if(x>1&&A.count({order[x-1],x-1})==0 && B.count({order[x-1],x-1})==0) nei++;
	if(x<N&&A.count({order[x+1],x+1})==0 && B.count({order[x+1],x+1})==0) nei++;
	
	if(nei==0) {
		B.erase({order[x],x});
		A.insert({order[x],x});
	}
	else {
		A.erase({order[x],x});
		B.insert({order[x],x});
	}
	
	
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>K1>>K2;
	x=0;
	if(K1<K2) {
		FOR(i,N) {
			if(K1-i>=1) order[K1-i]=x++;
			if(K2+i<=N) order[K2+i]=x++;
		}
	}
	else {
		FOR(i,N) {
			if(K1+i<=N) order[K1+i]=x++;
			if(K2-i>=1) order[K2-i]=x++;
		}
	}
	
	FOR(i,N) A.insert({order[i+1],i+1});
	cin>>M;
	FOR(i,M) {
		cin>>X[i]>>Y[i];
		ev.insert({X[i],M+i});
	}
	
	queue<int> Q;
	int pret=-1;
	while(ev.size()) {
		auto p=*ev.begin();
		ev.erase(ev.begin());
		
		if(pret<p.first) {
			while(Q.size() && (A.size()+B.size())) {
				x=Q.front();
				if(A.size()) {
					auto p2=*A.begin();
					A.erase(A.begin());
					ret[x]=p2.second;
					//cerr<<"!"<<p.first<<" "<<x<<" "<<ret[x]<<endl;
					ev.insert({p.first+Y[x],x});
					fix(ret[x]-1);
					fix(ret[x]+1);
					Q.pop();
				}
				else if(B.size()) {
					auto p2=*B.begin();
					B.erase(B.begin());
					ret[x]=p2.second;
					//cerr<<p.first<<" "<<x<<" "<<ret[x]<<endl;
					ev.insert({p.first+Y[x],x});
					fix(ret[x]-1);
					fix(ret[x]+1);
					Q.pop();
				}
			}
		}
		pret=p.first;
		
		if(p.second<M) {
			x=p.second;
			//cerr<<"#"<<ret[x]<<endl;
			B.insert({order[ret[x]],ret[x]});
			fix(ret[x]);
			fix(ret[x]-1);
			fix(ret[x]+1);
			
		}
		else {
			x=p.second-M;
			if(A.size()) {
				auto p2=*A.begin();
				A.erase(A.begin());
				ret[x]=p2.second;
					//cerr<<"!"<<p.first<<" "<<x<<" "<<ret[x]<<endl;
				ev.insert({p.first+Y[x],x});
				fix(ret[x]-1);
				fix(ret[x]+1);
			}
			else if(B.size()) {
				auto p2=*B.begin();
				B.erase(B.begin());
				ret[x]=p2.second;
					//cerr<<p.first<<" "<<x<<" "<<ret[x]<<endl;
				ev.insert({p.first+Y[x],x});
				fix(ret[x]-1);
				fix(ret[x]+1);
			}
			else {
				Q.push(x);
			}
		}
		
	}
	
	
	FOR(i,M) cout<<ret[i]<<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;
}