#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pair<int,int>>
#define vll vector<pair<ll,ll>>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define vvii vector<vector<pair<int,int>>>
#define vvll vector<vector<pair<ll,ll>>>
#define vst vector<string>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define mkunique(x) sort(all(x));(x).erase(unique(all(x)),(x).end())
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=400005,INF=15<<26;

set<pii> G[MAX];
int mita[MAX];

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    memset(mita,-1,sizeof(mita));
    
    int N,QQ;cin>>N>>QQ;
    int ans=1;
    
    vi ON(N,INF);
    ON[0]=0;
    
    for(int q=0;q<QQ;q++){
        int t;cin>>t;
        int x,y;cin>>x>>y;x--;y--;
        
        for(int qq=0;qq<2;qq++){
            if(ON[y]<=t){
                
            }else{
                if(ON[x]<t){
                    priority_queue<pii,vector<pii>,greater<pii>> PQ;
                    PQ.push(mp(t,x));
                    G[x].insert(mp(t,y));
                    
                    while(!PQ.empty()){
                        auto [t,u]=PQ.top();PQ.pop();
                        if(mita[u]==q) continue;
                        mita[u]=q;
                        
                        auto it=G[u].lower_bound(mp(t,-1));
                        while(it!=G[u].end()){
                            auto [tt,v]=*it;
                            if(ON[v]>tt){
                                if(ON[v]==INF) ans++;
                                PQ.push(mp(tt,v));
                                ON[v]=tt;
                            }
                            it=G[u].erase(it);
                        }
                    }
                }else{
                    G[x].insert(mp(t,y));
                }
            }
            
            swap(x,y);
        }
        
        cout<<ans<<"\n";
    }
}