#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;
using ll = long long;


int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int n,m;
    cin>>n>>m;
    vector<vector<int>> g(n);
    vector<vector<pair<int,int>>> use(n);
    vector<int> cnt(n,0);
    for(int i = 0;i<m;i++){
        int p,q,r;
        cin>>p>>q>>r;
        p--;r--;
        g[p].push_back(r);
        use[r].push_back(make_pair(p,q));
        cnt[r]++;
    }
    vector<vector<ll>> dp(n,vector<ll>(n,0));
    vector<int> que;
    for(int i = 0;i<n;i++) if(cnt[i]==0) que.push_back(i);
    for(int i = 0;i<que.size();i++){
        int ni = que[i];
        for(auto&to:g[ni]) {
            cnt[to]--;
            if(cnt[to]==0) que.push_back(to);
        }
        if(use[ni].size()==0){
            dp[ni][ni] = 1;
            continue;
        }
        for(auto&itr:use[ni]){
            int nj = itr.first;
            ll w = itr.second;
            for(int j = 0;j<n;j++) dp[ni][j] += dp[nj][j] * w;
        }
    }
    
    for(int i = 0;i<n-1;i++) cout<<dp[n-1][i]<<endl;

}