#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <queue>

///#include <tryhardmode>
///#include <GOMDODE::ON>

using namespace std;

#define cin fin
#define cout fout

ifstream fin ("bellmanford.in");
ofstream fout ("bellmanford.out");

const int NMAX=5e4+5;
const int INF=2e9;

vector<pair<int,int>>v[NMAX];

int dist[NMAX];
bool viz[NMAX];
int viz2[NMAX];
bool flag;
int n;

void bellman(int p)
{
    queue<pair<int,int>>q;
    dist[p]=0;
    viz[p]=true;
    q.push(make_pair(0,p));
    while(!q.empty())
    {
        pair<int,int>p=q.front();
        q.pop();
        viz[p.second]=false;
        for(auto i:v[p.second])
        {
            if(dist[i.first]>dist[p.second]+i.second)
            {
                dist[i.first]=dist[p.second]+i.second;
                viz2[i.first]++;
                if(viz2[i.first]==n)
                {
                    flag=true;
                    return ;
                }
                if(!viz[i.first])
                {
                    q.push(make_pair(-dist[i.first],i.first));
                    viz[i.first]=true;
                }
            }
        }
    }
}

int main()
{
    int m,i,j,x,y,c;
    cin>>n>>m;
    for(i=1;i<=m;i++)
    {
        cin>>x>>y>>c;
        v[x].push_back(make_pair(y,c));
    }
    for(i=1;i<=n;i++)
        dist[i]=INF;
    bellman(1);
    if(flag)
        cout<<"Ciclu negativ!\n";
    else
    {
        for(i=2;i<=n;i++)
            cout<<dist[i]<<" ";
    }
    return 0;
}