//#include <iostream>
#include <fstream>
#include <queue>
using namespace std;
ifstream cin("bellmanford.in");
ofstream cout("bellmanford.out");
bool inq[50005];
queue <int> pq;
vector <pair<int,int> > v[50005];
int d[50005],f[50005];
int main()
{
    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=1;i<=n;i++){
        d[i]=1000000000;
    }
    d[1]=0;
    inq[1]=1;
    f[1]=1;
    pq.push(1);
    while(pq.empty()==false){
        int nod=pq.front();
        pq.pop();
        inq[nod]=0;
        for(auto u:v[nod]){
            if(d[u.first]>d[nod]+u.second){
                d[u.first]=d[nod]+u.second;
                f[u.first]++;
                if(f[u.first]==n){
                    cout<<"Ciclu negativ!";
                    return 0;
                }
                if(inq[u.first]==0){
                    pq.push(u.first);
                    inq[u.first]=1;
                }
            }
        }
    }
    for(int i=2;i<=n;i++){
        cout<<d[i]<<" ";
    }
    return 0;
}