/*
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,fma,bmi,bmi2,sse4.2,popcnt,lzcnt")
*/

#include <bits/stdc++.h>
#define taskname ""
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define i64 long long
#define pb push_back
#define ff first
#define ss second
#define isz(x) (int)x.size()
using namespace std;

const int mxN = 2e5 + 5;
const int mod = 1e9 + 7;
const i64 oo = 1e18;

struct SegmentTree {
	int n;
	vector<int> sm;
	vector<long double> mx;

	SegmentTree(int n) : n(n), sm(4 * n + 10), mx(4 * n + 10) {}

	void update(int l, int r, int idx, int pos, long double val) {
		if (l == r) {
			mx[idx] = val;
			sm[idx] = 1;
			return;
		}
		int mid = (l + r) >> 1;
		if (pos <= mid) update(l, mid, idx << 1, pos, val);
		else update(mid + 1, r, idx << 1 | 1, pos, val);
		mx[idx] = max(mx[idx << 1], mx[idx << 1 | 1]);
		sm[idx] = sm[idx << 1] + calc(mid + 1, r, idx << 1 | 1, mx[idx << 1]);
	}

	void update(int pos, long double val) {
		update(1, n, 1, pos, val);
	}

	int calc(int l, int r, int idx, long double val) {
		if (mx[idx] < val) return 0;
		if (l == r) return mx[idx] > val;
		int mid = (l + r) >> 1;
		if (mx[idx << 1] < val) return calc(mid + 1, r, idx << 1 | 1, val);
		else return sm[idx] - sm[idx << 1] + calc(l, mid, idx << 1, val);
	}

	int getans() {
		return sm[1];
	}
};

int n, q;

void solve() {
	cin >> n >> q;
	SegmentTree st(n);
	while (q--) {
		int idx, val;
		cin >> idx >> val;
		st.update(idx, 1.0L * val / idx);
		cout << st.getans() << endl;
	}
}

signed main() {

#ifndef CDuongg
    if(fopen(taskname".inp", "r"))
        assert(freopen(taskname".inp", "r", stdin)), assert(freopen(taskname".out", "w", stdout));
#else
    freopen("bai3.inp", "r", stdin);
    freopen("bai3.out", "w", stdout);
    auto start = chrono::high_resolution_clock::now();
#endif

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1; //cin >> t;
    while(t--) solve();

#ifdef CDuongg
   auto end = chrono::high_resolution_clock::now();
   cout << "\n"; for(int i = 1; i <= 100; ++i) cout << '=';
   cout << "\nExecution time: " << chrono::duration_cast<chrono::milliseconds> (end - start).count() << "[ms]" << endl;
   cout << "Check array size pls sir" << endl;
#endif

}