#include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(int)(a); (i)<(int)(b); ++(i))
#define rFor(i, a, b) for(int (i)=(int)(a)-1; (i)>=(int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef unsigned long long ulint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;
template<class T> bool chmax(T &a, const T &b){if(a<b){a=b; return true;} return false;}
template<class T> bool chmin(T &a, const T &b){if(a>b){a=b; return true;} return false;}
template<class T> T div_floor(T a, T b){
    if(b < 0) a *= -1, b *= -1;
    return a>=0 ? a/b : (a+1)/b-1;
}
template<class T> T div_ceil(T a, T b){
    if(b < 0) a *= -1, b *= -1;
    return a>0 ? (a-1)/b+1 : a/b;
}

constexpr lint mod = 1e9+7;
constexpr lint INF = mod * mod;
constexpr int MAX = 200010;

int n, m;
lint need[110][110];
vector<pair<int, lint>> G[110];

void dfs(int v){
    if(need[v][0] >= 0) return;
    rep(i, n) need[v][i] = 0;
    if(G[v].empty()){
        need[v][v] = 1;
        return;
    }
    for(auto e: G[v]){
        dfs(e.fi);
        rep(i, n) need[v][i] += need[e.fi][i] * e.se;
    }
}

int main(){
    scanf("%d%d", &n, &m);
    rep(i, m){
        int p, r; lint q;
        scanf("%d%lld%d", &p, &q, &r);
        --p; --r;
        G[r].emplace_back(p, q);
    }
    rep(i, n)rep(j, n) need[i][j] = -1;
    dfs(n-1);
    rep(i, n-1) printf("%lld\n", need[n-1][i]);
}