#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <iomanip>
using namespace std;

#define endl '\n'
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define uniq(v) (v).erase(unique((v).begin(), (v).end()), (v).end())

typedef long long ll;
typedef pair<int, int> P;
typedef unsigned int uint;
typedef unsigned long long ull;
struct pairhash {
public:
    template<typename T, typename U>
    size_t operator()(const pair<T, U> &x) const {
	size_t seed = hash<T>()(x.first);
	return hash<U>()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2);
    }
};

const int inf = 1000000009;
const double eps = 1e-8;

struct edge {
    int to;
    ll cost;
};

int n;
vector<edge> g[110];
vector<int> rg[110];
ll res[110];

ll dfs(int k) {
    if (k == n) return 1;
    if (res[k] < 0) {
	ll c = 0;
	for (int i = 0; i < g[k].size(); i++) {
	    edge e = g[k][i];
	    c += e.cost * dfs(e.to);
	}
	res[k] = c;
    }
    return res[k];
}

int main() {
    /*
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);
    */

    int m;
    scanf("%d%d", &n, &m);
    for (int i = 0; i < m; i++) {
	int p, r;
	ll q;
	scanf("%d%lld%d", &p, &q, &r);
	g[p].push_back(edge{r, q});
	rg[r].push_back(p);
    }

    memset(res, -1, sizeof(res));
    for (int i = 1; i < n; i++) {
	if (res[i] < 0) {
	    dfs(i);
	}
    }

    for (int i = 1; i < n; i++) {
	printf("%lld\n", rg[i].size() == 0 ? res[i] : 0);
    }
}