#define _USE_MATH_DEFINES
 
#include <iostream>
#include <iomanip>
 
#include <algorithm>
#include <cmath>
 
#include <string>
//#include <array>
#include <list>
#include <queue>
#include <vector>
#include <complex>
#include <set>
#include <map>
 
/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
 
#define PII pair<int,int>
/////////
typedef long long LL;
typedef long double LD;
/////////
using namespace::std;
/////////
vector< vector< PII > > line(101);

int main(void){
    std::cin.tie(0); 
    std::ios::sync_with_stdio(false);
    std::cout << std::fixed;//
    //cout << setprecision(10);//
	
	int N,M;
	cin>>N>>M;
	int P,Q,R;
	rep(i,M){
		cin>>P>>Q>>R;
		line[R].push_back(PII(P,Q));
	}

	int ans[101];
	rep(i,101)ans[i]=0;

	set<int> makeSet,nextSet;
	makeSet.insert(N);
	ans[N] = 1;
	int now;
	set<int>::iterator itr;
	vector<PII>::iterator itr2;
	while( !makeSet.empty() ){	
		itr = makeSet.begin();
		while( itr != makeSet.end() ){
			itr2 = line[*itr].begin();
			if(itr2 != line[*itr].end() )
			{
				while( itr2 != line[*itr].end() ){
					ans[itr2->first] += itr2->second * ans[*itr];
					nextSet.insert( itr2->first );
					++itr2;
				}
				ans[*itr] = 0;
			}
			++itr;
		}
		makeSet = nextSet;
		nextSet.clear();
	}

	for(int i=1;i<N;++i){
		P(ans[i]);
	}
    return 0;
}