#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define numa(x,a) for(auto x: a)
#define ite iterator
#define mp make_pair
#define mt make_tuple
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define pf push_front
#define sec second
#define sz(x) ((int)(x).size())
#define ALL( c ) (c).begin(), (c).end()
#define gcd(a,b) __gcd(a,b)
#define mem(x,n) memset(x,n,sizeof(x))
#define endl "\n"
using namespace std;
template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}
template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); deploy<POS + 1, TUPLE, Ts...>(os, t); }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; }
#define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; }
#define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); }
#define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); }
#define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); }
using ll = long long;


vector <pair <int,ll> > edge[110];
map <int,ll> memo[110];

map <int,ll> dp_go(int now){
  if(sz(edge[now]) == 0){
    map <int,ll> ret;
    ret[now] = 1;
    return ret;
  }
  if(sz(memo[now]) != 0){
    return memo[now];
  }
  map <int,ll> h;

  numa(x,edge[now]){
    auto y = dp_go(x.fir);
    foreach(it,y){
      h[it->fir] += it->sec*x.sec;
    }
  }
  return memo[now] = h;
}

int main(){
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  int N,M;
  cin >> N;
  cin >> M;
  rep(i,M){
    int x,y,z;
    cin >> x >> y >> z;
    x--;z--;
    edge[z].pb(mp(x,y));
  }
  N--;
  auto ret = dp_go(N);
  ll ans[110] = {0};
  foreach(it,ret){
    if(it->fir != N){
      ans[it->fir] = it->sec;
    }
  }

  rep(i,N){
    if(i) cout << " ";
    cout << ans[i];
  }
  cout << endl;
  return 0;
}