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