//#include <iostream>
#include <fstream>
#include <queue>
using namespace std;
ifstream cin("bellmanford.in");
ofstream cout("bellmanford.out");
queue <int> q;
vector<pair<int,int> > v[50005];
int ap[50005],f[50005];
int main()
{
    int n,m,a,b,c,x;
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        f[i]=1000000000;
    }
    for(int i=1;i<=m;i++){
        cin>>a>>b>>c;
        v[a].push_back(make_pair(b,c));
    }
    q.push(1);
    f[1]=0;
    while(q.empty()==false){
        x=q.front();
        q.pop();
        ap[x]++;
        if(ap[x]>=n){
            cout<<"Ciclu negativ!";
            return 0;
        }
        for(auto u:v[x]){
            if(f[u.first]>f[x]+u.second){
                f[u.first]=f[x]+u.second;
                q.push(u.first);
            }
        }
    }
    for(int i=2;i<=n;i++){
        cout<<f[i]<<" ";
    }
    return 0;
}