//#include <bits/stdc++.h>
#include <assert.h>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <iterator>
#include <unistd.h>

using namespace std;

typedef signed long long ll;

#define pp(...) (void)printf(__VA_ARGS__)
#define For(x,to) for(x=0;x<(to);x++)
#define ForAuto(x,arr) for(auto& x:arr)
#define ForBeginEnd(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define All(a) (a.begin()),(a.end())
#define Zeros(a) memset(a,0,sizeof(a))
#define Minus(a) memset(a,0xff,sizeof(a))

#define PI 3.14159265
#define EPS (1e-10)
#define EPS_eq(a,b) (abs((a)-(b)) < EPS)

#pragma GCC diagnostic ignored "-Wconversion"

//#define int long long
#define INF 1000*1000

int dxy[] = {0, 1, 0, -1, 0};

typedef pair<int, int> P;

void pp_int(int x){ printf("%d\n", x); };

int i,j,k;

ll M = 100000009;

//ios::sync_with_stdio(false);

//-------------------------------------------------

// i番の製品を作るのに必要なj番の個数
int dp[105][105];
int n,m;

set<int> buy;
vector<pair<int, int> > pqr[105];

void rec(int dst){
    if(dp[dst][0]>=0){
        return;
    }
    memset(dp[dst], 0, sizeof(dp[dst]));
    if(buy.count(dst)){
        dp[dst][dst] = 1;
        return;
    }
    for(int i=0;i<pqr[dst].size();i++){
        pair<int, int> pointer = pqr[dst][i];
        int src = pointer.first;
        int num = pointer.second;
        rec(src);
        for(int j = 1; j <= n - 1; j++){
            dp[dst][j] += num * dp[src][j];
        }
    }
    return;
}

signed main() {
    cin>>n>>m;
//    cout<<n<<endl;
    for(int i=0;i<105;i++)
        memset(dp[i], -1, sizeof(dp[i]));

//    cout<<n<<endl;
    for(int i=1;i<=n-1;i++){
        buy.insert(i);
    }
//    cout<<n<<endl;
    for(int i=0;i<m;i++){
        int p, q, r;
        cin>>p>>q>>r;
        pqr[r].push_back({p, q});
        buy.erase(r);
    }
    rec(n);
//    cout<<n<<endl;
    for(int i=1;i<=n-1;i++){
        if(buy.count(i)){
            cout<<dp[n][i]<<endl;
        } else {
            cout<<0<<endl;
        }
    }
    return 0;
}