#include <fstream>
#include <climits>
#include <queue>
using namespace std;
ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");
int n,m,i,j,x,y,z,D[50010],N[50010],f[50010];
vector< pair<int,int> >L[50010];
queue<int> q;
int main(){
    fin>>n>>m;
    for(i=1;i<=m;i++){
        fin>>x>>y>>z;
        L[x].push_back(make_pair(y,z));
    }
    D[1]=0;
    for(i=2;i<=n;i++)
        D[i]=INT_MAX;
    q.push(1);
    f[1]=1;
    while(!q.empty()){
        x=q.front();
        q.pop();
        f[x]=0;
        for(i=0;i<L[x].size();i++){
            y=L[x][i].first;
            if(D[y]>D[x]+L[x][i].second){
                D[y]=D[x]+L[x][i].second;
                N[y]++;
                if(N[y]==n){
                    fout<<"Ciclu negativ!";
                    return 0;
                }
                if(f[y]==0){
                    q.push(y);
                    f[y]=1;
                }
            }

        }
    }
    for(i=2;i<=n;i++)
        fout<<D[i]<<" ";
    return 0;
}