#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")

#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,1,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

int main(){
    ll n,q;cin >> n >> q;
    vl dp(n,INF);dp[0]=0;
    vl u(q),v(q),qs(q);
    rep(i,q){
        ll a,b,c;cin >> a >> b >> c;a--;b--;c--;
        u[a]=b;v[a]=c;qs[a]=i+1;
    }
    rep(i,q){
        chmin(dp[v[i]],max(dp[u[i]],qs[i]));
        chmin(dp[u[i]],max(dp[v[i]],qs[i]));
    }
    //rep(i,n)cout << dp[i] <<" ";cout << endl;
    vl ans(q+1);
    rep(i,n)if(dp[i]<INF)ans[dp[i]]++;
    rep(i,q)ans[i+1]+=ans[i];
    rep(i,q)cout << ans[i+1] << endl;
}