#include <bits/stdc++.h>

using namespace std;
vector<pair<int,int>>v[50005];
int parcurs[50005],dist[50005];
queue<int>q;
int main()
{
    ifstream cin("bellmanford.in");
    ofstream cout("bellmanford.out");
    int n,m,x,y,z;
    cin>>n>>m;
    for(int i=0;i<m;i++)
    {
        cin>>x>>y>>z;
        v[x].push_back({y,z});
    }
    for(int i=2;i<=n;i++)
        dist[i]=10e9;
    q.push(1);
    int ok=0;
    while(q.size()>0&&ok==0)
    {
        int nodcurr=q.front();
        q.pop();
        for(auto x: v[nodcurr])
        {
            if(dist[x.first]>dist[nodcurr]+x.second)
            {
                dist[x.first]=dist[nodcurr]+x.second;
                q.push(x.first);
                parcurs[x.first]++;
                if(parcurs[x.first]==n)
                {
                    ok=1;
                    break;
                }
            }
        }
    }
    if(ok==1)
        cout<<"Ciclu negativ!";
    else
        for(int i=2;i<=n;i++)
        cout<<dist[i]<<" ";
    return 0;
}