#yuki-1344
def bellman_ford(s, n, Edges):
    sp = [float('inf')]*n  #各頂点への最短路
    sp[s] = 0  #自身への距離は0
    for i in range(n):  #頂点の数だけ回す
        update = False  #更新が行われたか
        for x, y, cost in Edges:
            if sp[x] < float('inf') and sp[y] > sp[x] + cost:
                sp[y] = sp[x] + cost
                update = True
        if not update:
            break
        if i == n-1:  #負閉路が存在
            return False
    return sp

N, M = map(int, input().split())  #N頂点、M辺

#辺集合
Edges = set()
for _ in range(M):
    s, t, d = map(int, input().split())
    Edges.add((s-1, t-1, d))

#到達不可能な場合0にする設定
for i in range(N):
    sp = bellman_ford(i, N, Edges)
    print(sum(l if l < float('inf') else 0 for l in sp))