#include <bits/stdc++.h>

#define REP(i, x, n) for(int i = x; i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define F first
#define S second
#define mp make_pair

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;

const int INF = 1 << 29;

vector<P> edge[100];

int main() {
  // ios_base::sync_with_stdio(false);
  int N, M;
  cin >> N >> M;

  vector<int> cnt(N);
  
  rep(i, M) {
    int p, q, r;
    cin >> p >> q >> r;
    p--;
    r--;
    edge[r].push_back(P(p, q));
    cnt[p]++;
  }

  vector<ll> ans(N);
  ans[N - 1] = 1;
  
  rep(i, N) {
    int idx = -1;
    int minV = INF;
    rep(j, N) if(minV > cnt[j]) {
      idx = j;
      minV = cnt[j];
    }
    cnt[idx] = INF;
    rep(j, edge[idx].size()) {
      ans[edge[idx][j].F] += ans[idx] * edge[idx][j].S;
      cnt[edge[idx][j].F]--;
    }
  }

  rep(i, N - 1) if(edge[i].size()) ans[i] = 0;
  
  rep(i, N - 1) cout << ans[i] << endl;

  return 0;
}