# O(EV)
def bellman_ford(s):
    d = [float('inf')]*n # 各頂点への最小コスト
    d[s] = 0 # 自身への距離は0
    for i in range(n):
        update = False # 更新が行われたか
        for x, y, z in g:
            if d[y] > d[x] + z:
                d[y] = d[x] + z
                update = True
        if not update:
            break
        # 負閉路が存在
        if i == n - 1:
            return -1
    return d

n,w=map(int,input().split())
g=[]
for _ in range(w):
    s,t,d=map(int,input().split())
    g.append([s-1,t-1,d])
#print(bellman_ford(0))
for i in range(n):
    ans=0
    for x in bellman_ford(i):
        if x==float('inf'):
            continue
        ans+=x
    print(ans)