void main() {
	const N = readInt;
	const M = readInt;
	auto P = new int[M];
	auto Q = new int[M];
	auto R = new int[M];
	auto G = new int[][](N, 0);
	foreach (i; 0 .. M) {
		P[i] = readInt - 1;
		Q[i] = readInt;
		R[i] = readInt - 1;
		G[R[i]] ~= i;
	}
	auto dp = new long[][](N, N);
	auto vis = new bool[N];
	void dfs(int u) {
		if (vis[u]) {
			return;
		}
		vis[u] = true;
		if (G[u].empty) {
			dp[u][u] = 1;
			return;
		}
		foreach (i; G[u]) {
			int v = u ^ P[i] ^ R[i];
			dfs(v);
			foreach (j; 0 .. N) {
				dp[u][j] += dp[v][j] * Q[i];
			}
		}
	}
	dfs(N - 1);
	foreach (i; 0 .. N - 1) {
		writeln(dp[N - 1][i]);
	}
}

import std,core.bitop;
string[]_R;
string readString(){while(_R.empty){_R=readln.chomp.split;}auto ret=_R.front;_R.popFront;return ret;}
int readInt(){return readString.to!int;}
long readLong(){return readString.to!long;}
real readReal(){return readString.to!real;}
bool chmin(T)(ref T A,T B){if(A>B){A=B;return true;}else{return false;}}
bool chmax(T)(ref T A,T B){if(A<B){A=B;return true;}else{return false;}}
int lowerBound(T)(T[]A,T x){int L=-1,R=cast(int)A.length;while(R-L>1){int mid=(L+R)/2;(A[mid]<x?L:R)=mid;}return R;}
int upperBound(T)(T[]A,T x){int L=-1,R=cast(int)A.length;while(R-L>1){int mid=(L+R)/2;(A[mid]<=x?L:R)=mid;}return R;}