#include <cstdio>
#include <queue>
#include <vector>
#define Max 50100
#define inf 999999999
using namespace std;

queue<int> q;
vector<int>G[Max], C[Max];
int n, m, i, x, y, c, d[Max], ciclu[Max];


int bellmanford(int x0)
{
    for (i=1; i<=n; i++) d[i]=inf;
    d[x0]=0;
    q.push(x0);
    while(!q.empty()){
        int x=q.front();
        ciclu[x]++;
        if (ciclu[x]>n) return -1;
        for(int i=0; i<G[x].size(); i++){
            if (d[G[x][i]]>d[x]+C[x][i]){
                d[G[x][i]]=d[x]+C[x][i];
                q.push(G[x][i]);
            }
        }
        q.pop();
    }
    return 1;
}

int main ()
{
    freopen("bellmanford.in", "r", stdin);
    freopen("bellmanford.out", "w", stdout);

    scanf("%d%d", &n, &m);

//    for (i=2; i<=n; i++) d[i]=inf;

    for (i=1; i<=m; i++){
        scanf ("%d%d%d", &x, &y, &c);
        G[x].push_back(y);
        C[x].push_back(c);
    }

    c=bellmanford(1);

    if (c>0){
        for (int i=2; i<=n; i++) printf("%d ", d[i]);
    }
    else printf("Ciclu negativ!");
    return 0;
}