#include <bits/stdc++.h>
#include <bits/extc++.h>
#define pii pair<int, int>
#define F first
#define S second
#define ranktree tree<pair<pii, int>, null_type, greater<pair<pii, int>>, rb_tree_tag, tree_order_statistics_node_update>

using namespace std;
using namespace __gnu_pbds;

ranktree rt;
int n, m;
pair<pii, int> team[100005];

signed main() {
    //ios::sync_with_stdio(0), cin.tie(0);
    cin >> n >> m;
    for (int i = 0; i < n; i++) team[i].F.F = team[i].F.S = team[i].S =  0;
    for (int i = 0; i < m; i++) {
        int tt, pp;
        cin >> tt >> pp;
        auto it = rt.find(team[tt]);
        if (it != rt.end()) rt.erase(it);
        team[tt].F.F++;
        team[tt].F.S -= pp;
        team[tt].S = i+1;
        rt.insert(team[tt]);
        int rk = rt.order_of_key(team[1]);
        cout << rk+1 << "\n";
    }
    return 0;
}