#include <iostream>
#include <vector>
#include <queue>

template <class T>
std::vector<T> vec(int len, T elem) { return std::vector<T>(len, elem); }

using lint = long long;

void solve() {
    int n, m;
    std::cin >> n >> m;

    std::vector<std::vector<std::pair<int, int>>> graph(n);
    std::vector<int> indeg(n, 0);
    while (m--) {
        int u, q, v;
        std::cin >> u >> q >> v;
        --u, --v;

        graph[u].emplace_back(q, v);
        ++indeg[v];
    }

    std::queue<int> que;
    auto ans = vec(n, vec(n, 0LL));
    for (int v = 0; v < n; ++v) {
        if (indeg[v] == 0) {
            que.push(v);
            ans[v][v] = 1;
        }
    }

    while (!que.empty()) {
        int u = que.front();
        que.pop();

        for (auto [q, v] : graph[u]) {
            for (int i = 0; i < n; ++i) {
                ans[v][i] += ans[u][i] * q;
            }
            if (--indeg[v] == 0) que.push(v);
        }
    }

    for (int i = 0; i < n - 1; ++i) {
        std::cout << ans[n - 1][i] << "\n";
    }
}

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

    solve();

    return 0;
}