#include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < (a); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
#define repr(i, a) for (int i = (a) - 1; i >= 0; i--)
#define repr2(i, a, b) for (int i = (b) - 1; i >= (a); i--)
using namespace std;
typedef long long ll;
const ll inf = 1e9;
const ll mod = 1e9 + 7;

vector<int> dp[111];
ll N, M;
vector<pair<ll, ll>> G[100]; // to, num

vector<int> calc(int curr) {
	if (dp[curr].size() > 0) return dp[curr];

	vector<int> res(N);
	for (auto e : G[curr]) {
		int next = e.first;
		int num = e.second;
		vector<int> d = calc(next);
		rep (i, N) {
			res[i] += d[i] * num;
		}
	}

	if (G[curr].size() == 0) {
		res[curr] = 1;	
	}

	return dp[curr] = res;
}

int main() {
	cin >> N >> M;
	rep (i, M) {
		int p, q, r;
		cin >> p >> q >> r;
		p--; r--;
		G[r].emplace_back(p, q);
	}

	auto res = calc(N - 1);

	rep (i, N - 1) {
		cout << res[i] << endl;
	}

	return 0;
}