#include <bits/stdc++.h>
using namespace std;
set<pair<int, int>> E;
map<int, int> cnt;
int main() {
	int n, q;
	scanf("%d%d", &n, &q);
	int m = 0, p = n;
	for (int i = 1; i <= q; i++) {
		int op, x, y;
		scanf("%d%d%d", &op, &x, &y);
		if (x > y) swap(x, y);
		if (op == 1 && E.find({x, y}) == E.end()) {
			m++;
			E.emplace(x, y);
			if (!cnt[x]) p--;
			if (!cnt[y]) p--;
			cnt[x]++, cnt[y]++; 
		} else if (op == 2 && E.find({x, y}) != E.end()) {
			m--;
			E.erase({x, y});
			cnt[x]--, cnt[y]--;
			if (!cnt[x]) p++;
			if (!cnt[y]) p++;
		}
		printf("%d\n", n - m - p);
	}
}