#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;

	queue<PII> q;
	q.push(PII(N,1) );
	PII now;
	while( !q.empty() ){
		now = q.front();q.pop();
		vector<PII>::iterator itr;
		itr = line[now.first].begin();
		if( itr != line[now.first].end() ){
			while( itr != line[now.first].end() ){
				q.push( PII(itr->first, itr->second * now.second ) );

				++itr;
			}
		}else{
			ans[now.first] += now.second;
		}
	}

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