#include<bits/stdc++.h>
using namespace std;
int n, m;
struct node {
	int l, r, ansa, ansb, tag;
} b[2000006];
inline void update(int p) {
	b[p].ansa = b[2 * p].ansa + b[2 * p + 1].ansa;
	b[p].ansb = b[2 * p].ansb + b[2 * p + 1].ansb;
	if (b[p].ansa) b[p].ansa++;
	if (b[p].ansb) b[p].ansb++;
}
inline void push_down(int p) {
	if (b[p].tag) {
		b[2 * p].tag ^= 1, b[2 * p + 1].tag ^= 1;
		swap(b[2 * p].ansa, b[2 * p].ansb);
		swap(b[2 * p + 1].ansa, b[2 * p + 1].ansb);
		b[p].tag = 0;
	}
}
inline void build(int p, int l, int r) {
	b[p].l = l, b[p].r = r;
	if (l == r) {
		b[p].ansa = 1, b[p].ansb = 0;
		return;
	}
	build(2 * p, l, (l + r) >> 1);
	build(2 * p + 1, ((l + r) >> 1) + 1, r);
	update(p);
}
inline void change(int p, int l, int r) {
	if (b[p].l >= l && b[p].r <= r) {
		swap(b[p].ansa, b[p].ansb);
		b[p].tag ^= 1;
		return;
	}
	push_down(p);
	int mid = (b[p].l + b[p].r) >> 1;
	if (r <= mid) change(2 * p, l, r);
	else if (l > mid) change(2 * p + 1, l, r);
	else change(2 * p, l, mid), change(2 * p + 1, mid + 1, r);
	update(p);
}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> m;
	int p, q;
	build(1, 1, n);
	for (int i = 1; i <= m; i++) {
		cin >> p >> q;
		change(1, p, q);
		cout << b[1].ansb << "\n";
	}
}
//后面两题都不会做，哭了
//T3 有40pts nL暴力，但我不想写了，就酱吧