/*
[templates]: 
duipai
spjdp
compre
addhis
floor_sum
treedfs
matrix
network_flow
polynomial
lca
bitset
valuesgt
fenwick
erbitree
*/
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx")
#include<bits/stdc++.h>
using namespace std;
#define int long long
//use ll instead of int.
#define f(i, a, b) for(int i = (a); i <= (b); i++)
#define cl(i, n) i.clear(),i.resize(n);
#define endl '\n'
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int inf = 1e18;
//#define cerr if(false)cerr
//#define freopen if(false)freopen
mt19937 rng(time(0)); 
int rnd(int l, int r) {return rng() % (r-l+1) + l; }
#define watch(x) cerr  << (#x) << ' '<<'i'<<'s'<<' ' << x << endl
void pofe(int number, int bitnum) {
    string s; f(i, 0, bitnum) {s += char(number & 1) + '0'; number >>= 1; } 
    reverse(s.begin(), s.end()); cerr << s << endl; 
    return;
}
template <typename TYP> void cmax(TYP &x, TYP y) {if(x < y) x = y;}
template <typename TYP> void cmin(TYP &x, TYP y) {if(x > y) x = y;}
//调不出来给我对拍！
//use std::array.
const int N = 100000; 
int fa[N + 10], sz[N + 10]; int cnt; 
int ans[N + 10]; 
vector<pii> vec[2 * N + 10]; 
stack<int> stk; 
int getfa(int x) {
    if(fa[x] == x) return fa[x]; 
    return getfa(fa[x]); 
}
void merge(int x, int y) {
    int fx = getfa(x), fy = getfa(y);
    if(sz[fx] < sz[fy]) swap(fx, fy); 
    stk.push(fy); 
    cnt -= (sz[fy] >= 2); 
    cnt -= (sz[fx] >= 2); 
    fa[fy] = fx; sz[fx] += sz[fy]; 
    cnt += (sz[fx] >= 2); 
}
void del() {
    int fy = stk.top(); stk.pop(); 
    cnt -= (sz[fa[fy]] >= 2); 
    sz[fa[fy]] -= sz[fy]; 
    cnt += (sz[fa[fy]] >= 2); 
    fa[fy] = fy; 
    cnt += (sz[fy] >= 2); 
}
int id(int l, int r) {return (l + r) | (l != r); }
void ins(int now, int l, int r, int x, int y, pii ed) {
    if(l >= x && r <= y) {
        // cerr << l << " " << r << " " << ed.first << " " << ed.second << endl; 
        vec[now].push_back(ed); 
        return; 
    }
    if(l > y || r < x) return; 
    int mid = (l + r) >> 1; 
    ins(id(l, mid), l, mid, x, y, ed); 
    ins(id(mid + 1, r), mid + 1, r, x, y, ed); 
    return; 
} 
void dfs(int now, int l, int r) {
    for(pii it : vec[now]) {
        merge(it.first, it.second); 
    }
    if(l == r) {
        ans[l] = cnt; 
    }
    else {
        int mid = (l + r) >> 1; 
        dfs(id(l, mid), l, mid); 
        dfs(id(mid + 1, r), mid + 1, r);
    }
    for(pii it __attribute__((unused)) : vec[now]) {
        del(); 
    }
}
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
    //freopen();
    //freopen();
    //time_t start = clock();
    //think twice,code once.
    //think once,debug forever.
    map<pii, int> s; 
    int n, q; cin >> n >> q; 
    f(i, 1, n) fa[i] = i, sz[i] = 1; 
    f(i, 1, q) {
        int u, x, y; cin >> u >> x >> y; if(x > y) swap(x, y); 
        if(u == 1) {
            if(s.count({x, y})) continue; 
            else s[{x, y}] = i; 
        }
        else {
            if(!s.count({x, y})) continue; 
            else {
                ins(id(1, q), 1, q, s[{x, y}], i - 1, {x, y});
                s.erase({x, y}); 
            }
        }
    }
    for(auto it : s) ins(id(1, q), 1, q, it.second, q, it.first);
    dfs(id(1, q), 1, q); 
    f(i, 1, q) cout << ans[i] << endl; 
    //time_t finish = clock();
    //cout << "time used:" << (finish-start) * 1.0 / CLOCKS_PER_SEC <<"s"<< endl;
    return 0;
}