#include <iostream>
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <algorithm>
#include <functional>
#include <limits.h>
#include <bitset>

#include <tuple>
#include <unordered_map>

#define mp       make_pair
#define mt       make_tuple
#define pb       push_back
#define rep(i,n) for(int i=0;i<(n);i++)

using namespace std;

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

const int INF=1<<29;
const double EPS=1e-9;

const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};
int N,M;
vector<pii> graph[110];
vector<int> sink;
bool visit[110];
int deg[110];
ll dp[110];
bool flag[110];
ll dfs(int pos){
  visit[pos] = true;
  if (pos == N - 1){
    return 1;
  }
  if (dp[pos] >= 0){
    return dp[pos];
  }
  ll res = 0;
  for (int i = 0; i < graph[pos].size(); i++){
    res += dfs(graph[pos][i].first) * graph[pos][i].second;
  }
  return dp[pos] = res;
}
int main(){
  cin >> N;
  cin >> M;
  for (int i = 0; i < M; i++){
    int a,b,c;
    cin >> a >> b >> c;
    a--,c--;
    graph[a].push_back(mp(c, b));
    deg[c]++;

  }
  for (int i = 0; i < N; i++){
    if (deg[i] == 0){
      sink.push_back(i);
    }
  }
  memset(dp, -1, sizeof(dp));
  for (int i = 0; i < sink.size(); i++){
    dfs(sink[i]);
  }
  for (int i = 0; i < N - 1; i++){
    cout << (deg[i] == 0 ? dp[i] : 0) << endl;
  }
}