#include <bits/stdc++.h>

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