import sys
input = sys.stdin.readline

#iを1個作るのに必要なjの数
def rec(i, j):
    if memo[i][j] != -1:
        return memo[i][j]
    
    if len(adj_list[i]) == 0:
        if i == j:
            memo[i][j] = 1
            return 1
        else:
            memo[i][j] = 0
            return 0
    
    res = 0
    
    for next_node, w in adj_list[i]:
        res += w * rec(next_node, j)
    
    memo[i][j] = res
    
    return res

N = int(input())
M = int(input())
adj_list = [[] for _ in range(N)]

for _ in range(M):
    Pi, Qi, Ri = map(int, input().split())
    adj_list[Ri-1].append((Pi-1, Qi))

memo = [[-1 for _ in range(N)] for _ in range(N)]

for i in range(N-1):
    print(rec(N-1, i))