#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <queue>

template <class T>
using MinHeap = std::priority_queue<T, std::vector<T>, std::greater<T>>;

using lint = long long;

void solve() {
    int n, k1, k2;
    std::cin >> n >> k1 >> k2;

    bool first1 = true;
    if (k1 > k2) {
        first1 = false;
        std::swap(k1, k2);
    }
    // k1 < k2

    std::set<int> s1;
    for (int i = 0; i <= n + 1; ++i) s1.insert(i);
    auto s2 = s1;

    int m;
    std::cin >> m;

    MinHeap<std::pair<lint, int>> ts;
    std::vector<lint> bs(m);
    for (int i = 1; i <= m; ++i) {
        lint a;
        std::cin >> a >> bs[i - 1];
        ts.emplace(a, i);
    }

    auto max = [&](int l, int r) -> int {
        int dl = k1 - l, dr = r - k2;
        if (dl != dr) {
            return dl < dr ? l : r;
        } else {
            return first1 ? l : r;
        }
    };

    auto get = [&]() -> int {
        int l = *(--s1.lower_bound(k2));
        int r = *s1.lower_bound(k2);
        int i = max(l, r);

        if (i == 0 || i == n + 1) {
            l = *(--s2.lower_bound(k2));
            r = *s2.lower_bound(k2);
            i = max(l, r);

            if (i == 0 || i == n + 1) return -1;
        }

        for (int j = i - 1; j <= i + 1; ++j) {
            if (1 <= j && j <= n) s1.erase(j);
        }
        s2.erase(i);
        return i;
    };

    auto check = [&](int i) -> bool {
        for (int d = -1; d <= 1; ++d) {
            if (!s2.count(i + d)) return false;
        }
        return true;
    };

    auto dump = [&]() {
        std::cerr << "\ns1: ";
        for (auto i : s1)
            if (1 <= i && i <= n) std::cerr << i << " ";
        std::cerr << "\n";
        std::cerr << "s2: ";
        for (auto i : s2)
            if (1 <= i && i <= n) std::cerr << i << " ";
        std::cerr << "\n";
    };

    std::vector<int> ans(m);
    std::queue<int> que;

    lint pt = -1;
    while (!ts.empty()) {
        auto [t, x] = ts.top();
        ts.pop();

        if (x < 0) {
            int i = ans[-x - 1];

            s2.insert(i);
            for (int j = i - 1; j <= i + 1; ++j) {
                if (check(j)) s1.insert(j);
            }

        } else {
            que.push(x);
        }

        if (t != pt) {
            while (!que.empty()) {
                int i = get();
                if (i == -1) break;

                int x = que.front();
                que.pop();
                ans[x - 1] = i;
                ts.emplace(t + bs[x - 1], -x);
            }
        }
        pt = t;
    }

    for (auto a : ans) std::cout << a << "\n";
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}