#include <iostream>
#include <algorithm>
using namespace std;
using i64 = long long;

struct edge { int to, cost; };
int n, m;
vector<vector<edge>> G;
vector<vector<i64>> dp;
vector<bool> is_start;

// uをひとつ作るのに必要なvの個数
i64 rec(int u, int v) {
  i64 &res = dp[u][v];
  if(res != -1) { return res; }
  if(u == v) { return res = 1; }
  res = 0;
  for(edge e : G[u]) {
    res += rec(e.to, v) * e.cost;
  }
  return res;
}

int main(void) {
  scanf("%d%d", &n, &m);
  G.assign(n, vector<edge>());
  is_start.assign(n, true);
  is_start[n-1] = false;
  for(int i=0; i<m; ++i) {
    int a, c, b; scanf("%d%d%d", &a, &c, &b);
    --a, --b;
    G[b].push_back(edge({a, c}));
    is_start[b] = false;
  }
  dp.assign(n, vector<i64>(n, -1));
  for(int i=0; i<n-1; ++i) {
    i64 res = rec(n-1, i);
    if(!is_start[i]) { res = 0; }
    printf("%lld\n", res);
  }
  return 0;
}