// Wrongri-La Shower

#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>

typedef long long ll;

struct Edge{
    int to;
    ll cost;
};

int N, M;
std::vector<Edge> G[101];
int count[101], degree[101];

void dfs(int u, int v, int c){
    if(u == N){count[v] += c; return;}
    
    for(const auto& e : G[u]){
        dfs(e.to, v, c * e.cost);
    }
}

int main(){
    scanf("%d %d", &N, &M);

    for(int i=0;i<M;i++){
        int p, q, r;
        scanf("%d %d %d", &p, &q, &r);
        
        G[p].push_back({r, q});
        ++degree[r];
    }

    for(int i=1;i<N;i++){
        if(degree[i] == 0){dfs(i, i, 1);}
    }

    for(int i=1;i<N;i++){
        printf("%d\n", count[i]);
    }
}