#include<fstream>
#include<queue>
#include<vector>
using namespace std;
ifstream cin("bellmanford.in");
ofstream cout("bellmanford.out");
queue < int > coada;
vector < pair <int,int> > graf[99999];
    bool verif[99999];
    long nr[99999];
    bool ciclu;
int main()
{
    long n,m,i,elem;
    cin>>n>>m;
    int dist[n+2];
    dist[1]=0;
    for(i=1;i<=m;i++)
    {
        int x,y,c;
        cin>>x>>y>>c;
        graf[x].push_back(make_pair(y,c));
    }
    coada.push(1);
    verif[1]=1;
    while(!coada.empty())
    {
        elem=coada.front();
        nr[elem]++;
        verif[elem]=0;
        coada.pop();
        if(nr[elem]==n)
        {
            ciclu=1;break;
        }
        for(i=0;i<graf[elem].size();i++)
        {
            if(graf[elem][i].second+dist[elem]<dist[graf[elem][i].first])
            {
                dist[graf[elem][i].first]=dist[elem]+graf[elem][i].second;
                   if(verif[graf[elem][i].first]==0)
            {
            coada.push(graf[elem][i].first);
            verif[graf[elem][i].first]=1;
            }
            }
        }
    }
    if(ciclu==1){cout<<"Ciclu negativ!";}else{
    for(i=2;i<=n;i++)cout<<dist[i]<<" ";}
}