Codeforces Round #366 (Div. 2), problem: (C) Thor

#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")

#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define pii pair<int,int>
#define pli pair<long long int,int>
#define pbi pair<bool,int>
#define pob pop_back
#define all(a) a.begin(),a.end()
#define fio ios_base::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);
#define i64 long long int
#define mem(x,y) memset(x,y,sizeof(x))
#define fill(arr,b) fill(arr, arr+sizeof(arr)/sizeof(arr[0]), b)
#define maxarr(n,arr,m) m=-1e9;for(int i=0;i<n;i++)if(arr[i]>m) m=arr[i];
#define read freopen("input.txt","r",stdin);
#define F first
#define S second

const int maxn = (i64)1e9+7;
const double pi = acos(-1.0);

//bool fne(const pii &a, const pii &b){return (a.F < b.F)||(a.F==b.F&&a.S<b.S);}
//bool sne(const pii &a, const pii &b){return (a.S < b.S)||(a.S==b.S&&a.F<b.F);}
set<int>st;
vector<int>v[300005];
int main()
{
    //read;
    fio;
    int n,q,r=0;
    cin>>n>>q;
    while(q--)
    {
        int t,x;
        cin>>t>>x;
        //cout<<t<<" "<<x<<endl;
        if(t==1)
        {
            r++;
            st.insert(r);
            v[x].pb(r);
        }
        else if(t==2)
        {
            for(auto i: v[x]) st.erase(i);
            v[x].clear();
        }
        else
        {
            auto i=st.begin();
            while(!st.empty()&&*i<=x) {st.erase(st.begin());i=st.begin();}
        }
        cout<<st.size()<<endl;
    }
    return 0;
}