#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <numeric>
#include <cctype>
#include <tuple>
#include <climits>
#include <bitset>
#include <cassert>
#include <random>

#ifdef _MSC_VER
#include <agents.h>
#endif

#define FOR(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define REV(v) v.rbegin(), v.rend()
#define MEMSET(v, s) memset(v, s, sizeof(v))
#define UNIQUE(v) (v).erase(unique(ALL(v)), (v).end())
#define MP make_pair
#define MT make_tuple

#define int long long

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

const int N = 110;
vector<P> G[N];

vector<int> dp[N];

int n, m;

vector<int> operator+(const vector<int> &a, const vector<int> &b){
	vector<int> res(n);
	rep(i, n) res[i] = a[i] + b[i];
	return res;
}

vector<int> operator*(const vector<int> &a, const int &b){
	vector<int> res(n);
	rep(i, n) res[i] = a[i]*b;
	return res;
}

vector<int> rec(int i){
	auto &res = dp[i];
	if (!res.empty()) return res;
	res.assign(n, 0);
	for (auto e : G[i]){
		res = res + rec(e.first)*e.second;
	}
	if (G[i].empty()) res[i] = 1;

	return res;
}

signed main(){
	cin.tie(0);
	ios::sync_with_stdio(false);

	cin >> n >> m;
	rep(i, m){
		int p, q, r;
		cin >> p >> q >> r;
		G[r - 1].push_back(MP(p - 1, q));
	}

	auto ans = rec(n - 1);
	rep(i, n - 1) cout << ans[i] << endl;

	return 0;
}