n = int(input()) m = int(input()) in_ = [0] * n edges = [[] for _ in range(n)] for _ in range(m): p, q, r = map(int, input().split()) p -= 1 r -= 1 in_[p] += 1 edges[r].append((p, q)) stack = [] for i in range(n): if in_[i] == 0: stack.append(i) dp = [0] * n dp[n - 1] = 1 ans = [0] * n while stack: pos = stack.pop() if len(edges[pos]) == 0: ans[pos] = dp[pos] for npos, c in edges[pos]: dp[npos] += dp[pos] * c in_[npos] -= 1 if in_[npos] == 0: stack.append(npos) print(*ans[:-1], sep="\n")