//#include <tourist>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define debug(v)          \
    cout << #v << ":";    \
    for (auto x : v)      \
    {                     \
        cout << x << ' '; \
    }                     \
    cout << endl;
template <class T>
bool chmax(T &a, const T &b)
{
    if (a < b)
    {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T &a, const T &b)
{
    if (b < a)
    {
        a = b;
        return 1;
    }
    return 0;
}
//cout<<fixed<<setprecision(15);有効数字15桁
//-std=c++14
//-std=gnu++17
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll n, m;
vector<vector<pair<ll, ll>>> v;
void dfs(ll k,vector<vector<ll>> &dp)
{
    if(dp[k][0]>=0)return;
    rep(i,n)dp[k][i]=0;
    if(v[k].size()==0){
        dp[k][k]=1;
        return ;
    }
    rep(i,v[k].size()){
        dfs(v[k][i].first,dp);
        rep(j,n){
            dp[k][j]+=dp[v[k][i].first][j]*v[k][i].second;
        }
    }
    return ;
}
int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> n >> m;
    v.resize(n);
    rep(i, m)
    {
        ll pp, qq, r;
        cin >> pp >> qq >> r;
        pp--;
        r--;
        v[r].push_back(make_pair(pp, qq));
    }
    vector<vector<ll>> dp(n, vector<ll>(n, -1));
    dfs(n - 1,dp);
    rep(i,n-1)cout<<dp[n-1][i]<<"\n";
    //debug(dp[n-1]);
}