#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <ctime>
 
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define FFOR(i,a,b) for(int i=(a);i<=(b);i++)
#define REP(i,b) FOR(i,0,b)
#define RREP(i,b) FFOR(i,1,b)
#define PB push_back
#define F first
#define S second
#define BE(c) c.begin(),c.end()
using namespace std;
typedef long long LL;
typedef LL ut;
typedef long double ld;
typedef pair<ut,ut> pr;
typedef vector<pr> Vpr;
typedef vector<ut> VI;
typedef pair<ut,pr> ppr;
typedef priority_queue<pr,Vpr, greater<pr> > PQ;
const int SIZE=1e+5 + 1;
const ut INF=1<<29;
const ld eps=1e-6;
const LL mod=1e+6 + 3;

vector<pr> G[128];
LL memo[128];
int N, M, P;

LL rec(int x){
	if(memo[x] != -1)
		return memo[x];
	if(x == P)
		return memo[x] = 1;
	
	LL res = 0;
	REP(i,G[x].size()){
		res += rec(G[x][i].F) * G[x][i].S;
	}
	return memo[x] = res;
}

int main() {
	int N, M;
	cin >> N >> M;
	memset(memo, -1, sizeof(memo));
	bool end[128] = {0};
	REP(i,M){
		int p, q, r;
		scanf("%d%d%d", &p, &q, &r);
		G[p].PB(pr(r, q));
		end[r] = true;
	}
	P = N;
	for(int i = 1; i < N; ++i){
		if(end[i])
			cout << "0" << endl;
		else
			cout << rec(i) << endl;
	}
 	return 0;
}