using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Threading;
using System.Text;
using System.Diagnostics;
using static util;
using P = pair<int, int>;

class Program {
    static void Main(string[] args) {
        var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
        var solver = new Solver(sw);
        // var t = new Thread(solver.solve, 1 << 26); // 64 MB
        // t.Start();
        // t.Join();
        solver.solve();
        sw.Flush();
    }
}

class Solver {
    StreamWriter sw;
    Scan sc;
    void Prt(string a) => sw.WriteLine(a);
    void Prt<T>(IEnumerable<T> a) => Prt(string.Join(" ", a));
    void Prt(params object[] a) => Prt(string.Join(" ", a));
    public Solver(StreamWriter sw) {
        this.sw = sw;
        this.sc = new Scan();
    }

    public void solve() {
        int n, k1, k2;
        sc.Multi(out n, out k1, out k2);
        --k1;
        --k2;
        var prior = new int[n];
        prior[k1] = 0;
        for (int i = 1, j = 0; i < n; i++)
        {
            int d = k2 - k1;
            {
                int k = k1 + i * d;
                if (0 <= k && k < n) {
                    prior[k] = ++j;
                }
            }
            {
                int k = k1 - i * d;
                if (0 <= k && k < n) {
                    prior[k] = ++j;
                }
            }
        }
        // DBG(prior);
        var hp = new Heap<P>(n) { rev = true };
        var pq = new PriorityQueue<pair<long, int>>() { rev = true };
        var ful = new bool[n];
        for (int i = 0; i < n; i++)
        {
            hp.Update(i, new P(0, prior[i]));
        }
        Func<int, int> status = j => {
            if (ful[j]) return 2;
            if ((j == 0 || !ful[j - 1]) && (j == n - 1 || !ful[j + 1])) return 0;
            return 1;
        };
        int q = sc.Int;
        for (int i = 0; i < q; i++)
        {
            long a, b;
            sc.Multi(out a, out b);
            while (pq.Count > 0 && pq.Top.v1 <= a || hp.Top.v1 == 2) {
                var p = pq.Pop();
                a = Math.Max(a, p.v1);
                var j = p.v2;
                ful[j] = false;
                hp.Update(j, new P(status(j), prior[j]));
                if (j > 0)
                    hp.Update(j - 1, new P(status(j - 1), prior[j - 1]));
                if (j < n - 1)
                    hp.Update(j + 1, new P(status(j + 1), prior[j + 1]));
            }
            {
                int j = hp.Top_Key;
                ful[j] = true;
                pq.Push(new pair<long, int>(a + b, j));
                hp.Update(j, new P(status(j), prior[j]));
                if (j > 0)
                    hp.Update(j - 1, new P(status(j - 1), prior[j - 1]));
                if (j < n - 1)
                    hp.Update(j + 1, new P(status(j + 1), prior[j + 1]));

                Prt(j + 1);
            }

        }



    }
}

class pair<T, U> : IComparable<pair<T, U>> {
    public T v1;
    public U v2;
    public pair() : this(default(T), default(U)) {}
    public pair(T v1, U v2) { this.v1 = v1; this.v2 = v2; }
    public int CompareTo(pair<T, U> a) {
        int c = Comparer<T>.Default.Compare(v1, a.v1);
        return c != 0 ? c : Comparer<U>.Default.Compare(v2, a.v2);
    }
    public override string ToString() => v1 + " " + v2;
    public void Deconstruct(out T a, out U b) { a = v1; b = v2; }
}
static class util {
    public static readonly int M = 1000000007;
    // public static readonly int M = 998244353;
    public static readonly long LM = 1L << 60;
    public static readonly double eps = 1e-11;
    public static void DBG(string a) => Console.Error.WriteLine(a);
    public static void DBG<T>(IEnumerable<T> a) => DBG(string.Join(" ", a));
    public static void DBG(params object[] a) => DBG(string.Join(" ", a));
    public static void Assert(bool cond) { if (!cond) throw new Exception(); }
    public static pair<T, U> make_pair<T, U>(T v1, U v2) => new pair<T, U>(v1, v2);
    public static int CompareList<T>(IList<T> a, IList<T> b) where T : IComparable<T> {
        for (int i = 0; i < a.Count && i < b.Count; i++)
            if (a[i].CompareTo(b[i]) != 0) return a[i].CompareTo(b[i]);
        return a.Count.CompareTo(b.Count);
    }
    public static bool inside(int i, int j, int h, int w) => i >= 0 && i < h && j >= 0 && j < w;
    static readonly int[] dd = { 0, 1, 0, -1 };
    // static readonly string dstring = "RDLU";
    public static P[] adjacents(int i, int j)
        => Enumerable.Range(0, dd.Length).Select(k => new P(i + dd[k], j + dd[k ^ 1])).ToArray();
    public static P[] adjacents(int i, int j, int h, int w)
        => Enumerable.Range(0, dd.Length).Select(k => new P(i + dd[k], j + dd[k ^ 1]))
                                         .Where(p => inside(p.v1, p.v2, h, w)).ToArray();
    public static P[] adjacents(this P p) => adjacents(p.v1, p.v2);
    public static P[] adjacents(this P p, int h, int w) => adjacents(p.v1, p.v2, h, w);
    public static Dictionary<T, int> compress<T>(this IEnumerable<T> a)
        => a.Distinct().OrderBy(v => v).Select((v, i) => new { v, i }).ToDictionary(p => p.v, p => p.i);
    public static Dictionary<T, int> compress<T>(params IEnumerable<T>[] a) => compress(a.Aggregate(Enumerable.Union));
    public static T[] inv<T>(this Dictionary<T, int> dic) {
        var res = new T[dic.Count];
        foreach (var item in dic) res[item.Value] = item.Key;
        return res;
    }
    public static void swap<T>(ref T a, ref T b) where T : struct { var t = a; a = b; b = t; }
    public static void swap<T>(this IList<T> a, int i, int j) where T : struct { var t = a[i]; a[i] = a[j]; a[j] = t; }
    public static T[] copy<T>(this IList<T> a) {
        var ret = new T[a.Count];
        for (int i = 0; i < a.Count; i++) ret[i] = a[i];
        return ret;
    }
}

class Scan {
    StreamReader sr;
    public Scan() { sr = new StreamReader(Console.OpenStandardInput()); }
    public Scan(string path) { sr = new StreamReader(path); }
    public int Int => int.Parse(Str);
    public long Long => long.Parse(Str);
    public double Double => double.Parse(Str);
    public string Str => sr.ReadLine().Trim();
    public pair<T, U> Pair<T, U>() {
        T a; U b;
        Multi(out a, out b);
        return new pair<T, U>(a, b);
    }
    public P P => Pair<int, int>();
    public int[] IntArr => StrArr.Select(int.Parse).ToArray();
    public long[] LongArr => StrArr.Select(long.Parse).ToArray();
    public double[] DoubleArr => StrArr.Select(double.Parse).ToArray();
    public string[] StrArr => Str.Split(new[]{' '}, StringSplitOptions.RemoveEmptyEntries);
    bool eq<T, U>() => typeof(T).Equals(typeof(U));
    T ct<T, U>(U a) => (T)Convert.ChangeType(a, typeof(T));
    T cv<T>(string s) => eq<T, int>()    ? ct<T, int>(int.Parse(s))
                       : eq<T, long>()   ? ct<T, long>(long.Parse(s))
                       : eq<T, double>() ? ct<T, double>(double.Parse(s))
                       : eq<T, char>()   ? ct<T, char>(s[0])
                                         : ct<T, string>(s);
    public void Multi<T>(out T a) => a = cv<T>(Str);
    public void Multi<T, U>(out T a, out U b)
    { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); }
    public void Multi<T, U, V>(out T a, out U b, out V c)
    { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); }
    public void Multi<T, U, V, W>(out T a, out U b, out V c, out W d)
    { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); }
    public void Multi<T, U, V, W, X>(out T a, out U b, out V c, out W d, out X e)
    { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); e = cv<X>(ar[4]); }
}

// the greatest element pops
class PriorityQueue<T> {
    List<T> buf;
    public bool rev = false;
    Func<int, int, int> cmp;
    public PriorityQueue() {
        buf = new List<T>();
        cmp = (i, j) => Comparer<T>.Default.Compare(buf[i], buf[j]) * (rev ? -1 : 1);
    }
    public PriorityQueue(Func<T, T, int> cmp) {
        buf = new List<T>();
        this.cmp = (i, j) => cmp(buf[i], buf[j]);
    }
    void swap(int i, int j) { var t = buf[i]; buf[i] = buf[j]; buf[j] = t; }
    public void Push(T elem) {
        int n = buf.Count;
        buf.Add(elem);
        while (n > 0) {
            int i = (n - 1) >> 1;
            if (cmp(n, i) <= 0) break;
            swap(i, n);
            n = i;
        }
    }
    public T Pop() {
        T ret = buf[0];
        int n = buf.Count - 1;
        buf[0] = buf[n];
        buf.RemoveAt(n);
        for (int i = 0, j; (j = (i << 1) | 1) < n; i = j) {
            if (j != n - 1 && cmp(j, j + 1) < 0) ++j;
            if (cmp(i, j) < 0) swap(i, j);
            else break;
        }
        return ret;
    }
    public T Top => buf[0];
    public int Count => buf.Count;
}
class Heap<T> {
    int n;
    T[] values;
    int[] keys, indices;
    Func<int, int, int> cmp;
    public bool rev = false;
    public Heap(int m) {
        values = new T[m];
        keys = new int[m];
        indices = new int[m];
        for (int i = 0; i < m; i++) {
            keys[i] = -1;
            indices[i] = -1;
        }
        n = 0;
        cmp = (i, j) => Comparer<T>.Default.Compare(values[i], values[j]) * (rev ? -1 : 1);
    }

    public void Update(int i, T val) {
        if (indices[i] == -1) {
            keys[n] = i;
            indices[i] = n;
            ++n;
        }
        values[i] = val;
        int p = indices[i];
        while (p > 0) {
            int par = p - 1 >> 1;
            if (cmp(keys[par], i) < 0) {
                keys[p] = keys[par];
                indices[keys[p]] = p;
                p = par;
            }
            else break;
        }
        while ((p << 1 | 1) < n) {
            int ch = p << 1 | 1;
            if (ch < n - 1 && cmp(keys[ch], keys[ch + 1]) < 0) ++ch;
            if (cmp(i, keys[ch]) < 0) {
                keys[p] = keys[ch];
                indices[keys[p]] = p;
                p = ch;
            }
            else break;
        }
        keys[p] = i;
        indices[i] = p;
    }
    public int Pop() {
        --n;
        int ret = keys[0];
        indices[ret] = -1;
        int i = keys[n];
        keys[n] = -1;
        T val = values[i];
        if (n == 0) return ret;
        int p = 0;
        while ((p << 1 | 1) < n) {
            int ch = p << 1 | 1;
            if (ch < n - 1 && cmp(keys[ch], keys[ch + 1]) < 0) ++ch;
            if (cmp(i, keys[ch]) < 0) {
                keys[p] = keys[ch];
                indices[keys[p]] = p;
                p = ch;
            }
            else break;
        }
        keys[p] = i;
        indices[i] = p;
        return ret;
    }
    public T Top => values[keys[0]];
    public int Top_Key => keys[0];
}