#include<cstdio>
#include<vector>
#include<queue>
#define DMAX 2000000000
using namespace std;
vector< pair<int,int> >L[50100];
queue<int>q;
int n,m,a,b,c,i,j,x[50100],v[50100];
FILE *f,*g;
int main(){
    f=fopen("bellmanford.in","r");
    g=fopen("bellmanford.out","w");
    fscanf(f,"%d%d",&n,&m);
    for(i=1;i<=m;i++){
        fscanf(f,"%d%d%d",&a,&b,&c);
        L[a].push_back(make_pair(b,c));
    }
    for(i=2;i<=n;i++){
        v[i]=DMAX;
    }
    q.push(1);
    while(!q.empty()){
        a=q.front();
        q.pop();
        x[a]++;
        if(x[a]==n){
            fprintf(g,"Ciclu negativ!");
            return 0;
        }
        for(i=0;i<L[a].size();i++){
            if( v[ L[a][i].first ] > v[a] + L[a][i].second ){
                v[ L[a][i].first ] = v[a] + L[a][i].second;
                q.push(L[a][i].first);
            }
        }
    }
    for(i=2;i<=n;i++){
        fprintf(g,"%d ",v[i]);
    }

    fclose(f);
    fclose(g);
    return 0;
}