// 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define debug(...) fprintf (stderr, __VA_ARGS__)

#define lep(i, l, r) for (int i = (l), i##_end = (r); i <= i##_end; ++ i)
#define rep(i, r, l) for (int i = (r), i##_end = (l); i >= i##_end; -- i)

char _c; bool _f; template <class T> inline void IN (T & x) {
	x = 0, _f = 0; while (_c = getchar (), ! isdigit (_c)) if (_c == '-') _f = 1;
	while (isdigit (_c)) x = x * 10 + _c - '0', _c = getchar (); if (_f) x = - x;
}

// const int mod = 998244353;
// inline int mul (int x, int y) { return 1ll * x * y % mod; }
// inline int qpow (int x, int y, int r = 1) { for ( ; y; y >>= 1, x = mul (x, x)) if (y & 1) r = mul (r, x); return r; }
// inline void pls (int & x, int y) { x += y; if (x >= mod) x -= mod; }
// inline int add (int x, int y) { x += y; if (x >= mod) x -= mod; return x; }

const int N = 5e5 + 5;

// segment tree

int mi[N << 2], cnt[N << 2], tag[N << 2];

inline void apply (int x, int y) {
	mi[x] += y, tag[x] += y;
}
inline void pushdown (int x) {
	if (tag[x]) {
		apply (x << 1, tag[x]);
		apply (x << 1 | 1, tag[x]);
		tag[x] = 0;
	}
}
inline void pushup (int x) {
	mi[x] = min (mi[x << 1], mi[x << 1 | 1]);
	cnt[x] = cnt[x << 1] * (mi[x] == mi[x << 1]) + cnt[x << 1 | 1] * (mi[x] == mi[x << 1 | 1]);
}

void build (int x, int l, int r) {
	mi[x] = 0, cnt[x] = r - l + 1;
	if (l != r) {
		int mid = l + r >> 1;
		build (x << 1, l, mid);
		build (x << 1 | 1, mid + 1, r);
	}
}
void modi (int x, int l, int r, int L, int R, int v) {
	if (L <= l && r <= R) return apply (x, v), void ();
	pushdown (x);
	int mid = l + r >> 1;
	if (L <= mid) modi (x << 1, l, mid, L, R, v);
	if (R > mid) modi (x << 1 | 1, mid + 1, r, L, R, v);
	pushup (x);
}

//

int n, m, deg[N];

// fenwick

int fen[N];
inline void modi (int x, int y) { for ( ++ x; x; fen[x] += y, x -= x & - x); }
inline int qsum (int x) { int u = 0; for ( ++ x; x <= n; u += fen[x], x += x & - x); return u; }

//

inline void add (int u) {
	modi (1, 1, n, 1, qsum (deg[u] + 1) + 1, 1);
	modi (deg[u], -1), modi ( ++ deg[u], +1);
}
inline void dec (int u) {
	modi (1, 1, n, 1, qsum (deg[u]), -1);
	modi (deg[u], -1), modi ( -- deg[u], +1);
}

signed main () {
	IN (n), IN (m);
	set <pair <int, int> > edge;
	lep (i, 1, n) modi (deg[i] = n - i, 1);
	build (1, 1, n);
	for (int u, v, i = 1; i <= m; ++ i) {
		if ( IN (u), IN (v), edge.find ({ u, v }) != edge.end () ) {
			edge.erase ({ u, v });
			add (u), dec (v);
		} else {
			edge.insert ({ u, v });
			dec (u), add (v);
		}
		assert (mi[1] == 0);
		printf ("%d\n", cnt[1]);
	}
	return 0;
}