#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll n, q, op[100010], x[100010], y[100010], d[100010], ans[100010];
map<pair<int, int>, int> mp;
/*
ll fa[100010], ans1, cnt[100010];
int find(int x){
	return fa[x] == x ? x : fa[x] = find(fa[x]);
}
void merge(int a, int b){
	int fx = find(a), fy = find(b);
	if(fx == fy)
		return;
	if(cnt[fx] > cnt[fy])
		swap(fx, fy);
	cnt[fy] += (cnt[fx] == cnt[fy]);
	fa[fx] = fy;
}
//*/
signed main()
{
    scanf("%d%d", &n, &q);
    for(int i = 1 ; i <= q ; i++){
    	scanf("%d%d%d", op + i, x + i, y + i);
    	if(y[i] > x[i])
    		swap(x[i], y[i]);
    	op[i] %= 2;
    	if(op[i] == mp[{x[i], y[i]}]){
    		ans[i] = ans[i - 1];
		}
		else{
    		mp[{x[i], y[i]}] = op[i];
    		if(op[i] == 0){
    			if(d[x[i]] == 1 && d[y[i]] == 1)
    				ans[i] = ans[i - 1] - 1;
    			else if(d[x[i]] == 1 || d[y[i]] == 1)
    				ans[i] = ans[i - 1];
    			else
    				ans[i] = ans[i - 1] + 1;
    			d[x[i]]--;
    			d[y[i]]--;
			}
			else{
				if(d[x[i]] == 0 && d[y[i]] == 0)
					ans[i] = ans[i - 1] + 1;
				else if(d[x[i]] == 0 || d[y[i]] == 0)
					ans[i] = ans[i - 1];
				else
					ans[i] = ans[i - 1] - 1;
				d[x[i]]++;
				d[y[i]]++;
			}
		}
		printf("%d\n", ans[i]);
	}
    exit(0);
}
/*
*/