#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template<class T>
inline bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
inline bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return true;
    }
    return false;
}

#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
//const ll mod = 1000000007;
ll N, K[2], Q;
ll PRIORITY[105000];
ll ans[105000];
ll a[105000], b[105000];
priority_queue<l_l, vector<l_l>, greater<l_l>> que;
queue<ll> QUEUE;
set<l_l> st[2];

bool seat[105000];

void sit(int s) {
    seat[s] = true;
    for(int i = 0; i <= 1; i++) {
        auto itr = st[i].lower_bound({PRIORITY[s], s});
        if((*itr).second == s) {
            st[i].erase(itr);
        }
    }
    for(int t = s - 1; t <= s + 1; t += 2) {
        if(t <= 0 || t > N) continue;
        auto itr = st[0].lower_bound({PRIORITY[t], t});
        if((*itr).second == t) {
            st[1].insert(*itr);
            st[0].erase(itr);
        }
    }
}

void leave(int s) {
    seat[s] = false;
    if(!seat[s-1] && !seat[s+1]) {
        st[0].insert({PRIORITY[s], s});
    } else {
        st[1].insert({PRIORITY[s], s});
    }
    for(int t = s - 1; t <= s + 1; t += 2) {
        if(t <= 0 || t > N) continue;
        if(seat[t]) continue;
        if(!seat[t-1] && !seat[t+1]) {
            auto itr = st[1].lower_bound({PRIORITY[t], t});
            st[0].insert(*itr);
            st[1].erase(itr);
        }
    }
}

int main() {
    //cout.precision(10);
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> N;
    for(int i = 1; i <= N; i++) {
        PRIORITY[i] = 1e9;
    }
    for(int i = 0; i <= 1; i++) {
        cin >> K[i];
        for(int j = 1; j <= N; j++) {
            chmin(PRIORITY[j], abs(K[i] - j) * 2 + i);
        }
    }
    /*
    for(int i = 1; i <= N; i++) {
        cerr << PRIORITY[i] << " ";
    }
    cerr << endl;
    */
    cin >> Q;
    for(int i = 1; i <= Q; i++) {
        cin >> a[i] >> b[i];
        que.push({a[i], i});
    }
    for(int i = 0; i <= 1; i++) {
        st[i].insert({1e9, 1e9});
    }
    for(int i = 1; i <= N; i++) {
        st[0].insert({PRIORITY[i], i});
    }
    while(!que.empty()) {
        l_l now = que.top();
        //cerr << now.first << " " << now.second << endl;
        que.pop();
        if(now.second > 0) {
            QUEUE.push(now.second);
        } else {
            leave(-now.second);
        }
        if(!que.empty()) {
            if(que.top().first == now.first) continue;
        }
        while(!QUEUE.empty()) {
            bool ok = false;
            int person = QUEUE.front();
            //cerr << "QUEUE:" << person << endl;
            for(int i = 0; i <= 1; i++) {
                if(st[i].size() == 1) continue;
                auto itr = st[i].begin();
                //cerr << i << " " << (*itr).first << " " << (*itr).second << endl;
                ans[person] = (*itr).second;
                que.push({now.first + b[person], -(*itr).second});
                ok = true;
                //cerr << "person" << person << " sits " << (*itr).second << endl;
                sit((*itr).second);
                break;
            }
            if(!ok) break;
            QUEUE.pop();
        }
    }
    for(int i = 1; i <= Q; i++) {
        cout << ans[i] << endl;
    }
    return 0;
}