#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 4000000000000000001LL

int main(){
	
	int n,q;
	cin>>n>>q;
	
	vector<int> p(q),x(q),y(q);
	vector<int> cur(n,Inf32);
	cur[0] = 0;
	int ans = 1;
	vector<set<pair<int,int>>> s(n);
	rep(i,q){
		cin>>p[i]>>x[i]>>y[i];
		x[i]--,y[i]--;
		queue<pair<int,int>> Q;
		if(cur[x[i]]<p[i] && cur[y[i]]>p[i]){
			Q.emplace(y[i],p[i]);
		}
		else if(cur[y[i]]<p[i] &&cur[x[i]]>p[i]){
			Q.emplace(x[i],p[i]);
		}
		else{
			s[x[i]].emplace(p[i],y[i]);
			s[y[i]].emplace(p[i],x[i]);
		}
		while(Q.size()>0){
			int t = Q.front().second,u = Q.front().first;
			Q.pop();
			if(cur[u]<=t)continue;
			if(cur[u]==Inf32)ans++;
			cur[u] = t;
			while(s[u].size()>0){
				auto it = s[u].begin();
				if((*it).first>cur[u]){
					Q.emplace((*it).second,it->first);
					s[u].erase(it);
				}
				else break;
			}
		}
		cout<<ans<<endl;
	}
	
	return 0;
}