#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
///// This part below is only for debug, not used /////
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
///// END /////

int main()
{
    int N, K, K2;
    cin >> N >> K >> K2;
    vector<int> yusen(N + 2);

    int i = K, j = K2, pr = 0;
    if (K2 < K) {
        i = K2, j = K + 1, pr = 1;
    }
    while (true) {
        if (i <= 0 and j > N) break;
        if (i > 0) yusen[i--] = pr++;
        if (j <= N) yusen[j++] = pr++;
    }
    auto f = [&](int l, int r){ return yusen[l] < yusen[r]; };
    set<int, function<bool(int l, int r)>> aki(f), aki_pri(f);
    FOR(i, 1, N + 1) aki.insert(i), aki_pri.insert(i);
    map<lint, vector<plint>> kyaku;
    int Q;
    cin >> Q;
    REP(q, Q) {
        int a, b;
        cin >> a >> b;
        kyaku[a].emplace_back(q, b);  // hito, duration
    }
    lint t = -1;
    vector<int> ret(Q);
    queue<plint> waiting;
    vector<int> state(N + 2);
    while (true)
    {
        auto p = kyaku.upper_bound(t);
        if (p == kyaku.end()) break;
        t = p->first;
        for (auto pa : p->second) {
            lint q = pa.first, T = pa.second;
            if (q >= 0) waiting.emplace(pa);
            if (q < 0)
            {
                aki.insert(T);
                state[T] = 0;
                FOR(d, -1, 2) if ((T + d - 1 < 0 or !state[T + d - 1]) and !state[T + d] and !state[T + d + 1] and T + d > 0 and T + d <= N) aki_pri.insert(T + d);

            }
        }
        while (aki.size() and waiting.size()) {
            lint q = waiting.front().first, T = waiting.front().second;
            int v;
            if (aki_pri.size())
            {
                v = *aki_pri.begin();
                aki_pri.erase(v);
                aki_pri.erase(v - 1);
                aki_pri.erase(v + 1);
            }
            else
            {
                v = *aki.begin();
            }
            waiting.pop();
            kyaku[t + T].emplace_back(-1, v);
            aki.erase(v);
            state[v] = 1;
            ret[q] = v;
        }
    }
    REP(q, Q) printf("%d\n", ret[q]);
}