#include <bits/stdc++.h>

using namespace std;



int main()
{
    priority_queue<int, vector<int>, greater<>> p;
    priority_queue<pair<int, int>, vector<pair<int,int>>, greater<>> t;

    freopen("proc2.in", "r", stdin);
    freopen("proc2.out", "w", stdout);

    int n, m, s, d, j;
    scanf("%d %d", &n, &m);

    for(int i=1; i<=n; ++i)
        p.push(i);

    for(int i=0; i<m; ++i)
    {
        scanf("%d %d", &s, &d);
        if(!t.empty())
        {
            while(s >= t.top().first)
            {
                p.push(t.top().second);
                t.pop();
            }
        }
        printf("%d\n", p.top());
        t.push({s+d, p.top()});
        p.pop();
    }
    return 0;
}