#include<iostream>
#include<cstring>
#include<vector>
#include<algorithm>
using namespace std;
typedef pair<int,int> P;
typedef long long int ll;

ll dfs(int now);
int n,m;
vector<P> data[101];
bool used[101];
bool flg[101];
ll cou[101];

int main(){
	cin >> n >> m;
	memset(flg,true,n+2);
	for(int i=0;i<m;i++){
		int a,b,c;
		cin >> a >> b >> c;
		a--; c--;
		data[a].push_back(P(c,b));
		flg[c] = false;
	}
	memset(cou,0,n+1);
	for(int i=0;i<n;i++){
		if(flg[i]){
			cou[i]=dfs(i);
		}
	}
	for(int i=0;i<n-1;i++){
		cout << cou[i] << endl;
	}
}

ll dfs(int now){
	if(now == n-1) return 1;
	ll res = 0;
	int len = data[now].size();
	for(int i=0;i<len;i++){
		P p = data[now][i];
		int next = p.first;
		int num = p.second;
		res += dfs(next) *  num;
	}
	return res;
}