#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef unsigned long long ULL;

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(auto i: c)
#define SORT(c) sort((c).begin(),(c).end())

#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()

const double EPS = 1e-10;
const double PI  = acos(-1.0);

#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	int N, M;
	cin >> N >> M;

	vector<vector<PII> > staple(N + 1);
	vector<vector<LL>> memo(N + 1);
	REP(i, M){
		int P, Q, R;
		cin >> P >> Q >> R;
		staple[R].push_back(make_pair(P, Q));
	}

	function<void(int)> f = [&](int product){
		if(memo[product].empty()){
			if(staple[product].empty()){
				vector<LL> ret(N + 1, 0);
				ret[product] = 1;
				memo[product] = ret;
			}
			else{
				vector<LL> ret(N + 1, 0);
				memo[product] = ret;
				for(auto i: staple[product]){
					f(i.first);
					REP(k, N + 1){
						memo[product][k] += memo[i.first][k] * i.second;
					}
				}
			}
		}
	};
	f(N);

	FOR(i, 1, N){
		cout << memo[N][i] << endl;
	}


	return 0;
}