#include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <queue>
#include <stack>
#include <iomanip>

using namespace std;

#define REP(i, n) for(ll i = 0;i < n;i++)
#define REPR(i, n) for(ll i = n;i >= 0;i--)
#define FOR(i, m, n) for(ll i = m;i < n;i++)
#define FORR(i, m, n) for(ll i = m;i >= n;i--)
#define REPO(i, n) for(ll i = 1;i <= n;i++)
#define ll long long
#define INF (ll)1 << 60
#define MINF (-1 * INF)
#define ALL(n) n.begin(),n.end()
#define MOD 1000000007
#define P pair<ll, ll>


ll n, m;
struct edge { ll to, cost; };
vector<ll> in(110);
vector<edge> g[110];
int main() {
	cin >> n >> m;
	REP(i, m) {
		ll a, b, c;
		cin >> a >> b >> c;
		a--;
		c--;
		g[a].push_back({ c,b });
		in[c]++;
	}
	REP(i, n - 1) {
		bool used[110] = {};
		vector<ll> nin(110);
		vector<ll> ans(n);
		ans[i] = 1;
		queue<ll> que;
		que.push(i);
		while (!que.empty()) {
			ll now = que.front();
			used[now] = true;
			que.pop();
			REP(k, g[now].size()) {
				nin[g[now][k].to]++;
				if (!used[g[now][k].to])que.push(g[now][k].to);
			}
		}
		que.push(i);
		while (!que.empty()) {
			ll now = que.front();
			que.pop();
			REP(k, g[now].size()) {
				ans[g[now][k].to] += ans[now] * g[now][k].cost;
				nin[g[now][k].to]--;
				if(nin[g[now][k].to] == 0)que.push(g[now][k].to);
			}
		}
		if (in[i] != 0)cout << 0 << endl;
		else cout << ans[n - 1] << endl;
	}
}