#include<bits/stdc++.h>
using namespace std;
int n,q,op,u,v,d[100005],ans;
unordered_map<long long,bool>m;
long long to(int u,int v){
    return (u-1LL)*1LL*n+v-1LL;
}
int main(){
    scanf("%d%d",&n,&q);
    while(q--){
        scanf("%d%d%d",&op,&u,&v);
        if(op==1){
            if(m[to(u,v)]||m[to(v,u)]){
                printf("%d\n",ans);
                continue;
            }
            if(!d[u]&&!d[v])ans++;
            else if(d[u]&&d[v])ans--;
            d[u]++,d[v]++,m[to(u,v)]=m[to(v,u)]=1;
        }
        else{
            if(!m[to(v,u)]&&!m[to(u,v)]){
                printf("%d\n",ans);
                continue;
            }
            if(d[u]>1&&d[v]>1)ans++;
            else if(d[u]==1&&d[v]==1)ans--;
            d[u]--,d[v]--,m[to(u,v)]=m[to(v,u)]=0;
        }
        printf("%d\n",ans);
    }
    return 0;
}