#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#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>
#include <fstream>
#include <queue>
#include <complex>

#define INF 100000000
#define INF_INT_MAX 2147483647
#define INF_LL_MAX 9223372036854775807
#define EPS 1e-10
#define Pi acos(-1)
#define LL long long
#define ULL unsigned long long

using namespace std;

typedef pair<int, int> II;

#define MAX_N 105

int N, M;

vector<II> Edge[MAX_N]; //first:node second:cost
int memo[MAX_N];
bool sNode[MAX_N];

void init(){

	memset(memo, -1, sizeof(memo));
	for (int i = 0; i < MAX_N; i++){
		sNode[i] = true;
	}

}

int solve(int pos){
	
	if (memo[pos] != -1)
		return memo[pos];

	if (pos == N)
		return memo[pos] = 1;

	int ret = 0;

	for (int i = 0; i < Edge[pos].size(); i++){
		ret += Edge[pos][i].second * solve(Edge[pos][i].first);
	}

	return memo[pos] = ret;

}

int main(){

	init();

	cin >> N >> M;
	for (int i = 0; i < M; i++){
		int P, Q, R;
		cin >> P >> Q >> R;
		sNode[R] = false;
		Edge[P].push_back(II(R, Q));
	}

	for (int i = 1; i < N; i++){
		if (sNode[i])
			cout << solve(i) << endl;
		else
			cout << 0 << endl;
	}

	return 0;

}