#include <bits/stdc++.h>

using namespace std;
ifstream in("bellmanford.in");
ofstream out("bellmanford.out");
int n,m,x,y,d[50005],inq[50005],cnt[50005],c,ok;
vector<pair<int,int>> v[50005];
queue<pair<int,int>> q;
pair<int,int> z;
void bellman(int nod)
{
    for(int i=1;i<=n;i++) d[i]=1e9;
    d[nod]=0;
    q.push({0,nod});
    while(!q.empty())
    {
        z=q.front();
        q.pop();
        inq[z.second]=0;
        for(auto it:v[z.second])
        {
            if(d[it.second]>d[z.second]+it.first)
            {
               d[it.second]=d[z.second]+it.first;
               if(!inq[it.second])
               {
                   inq[it.second]=1;
                   cnt[it.second]++;
                   if(cnt[it.second]>n)
                   {
                       ok=0;
                       return;
                   }
                   q.push({d[it.second],it.second});
               }
            }
        }
    }
}
int main()
{
    in>>n>>m;
    for(int i=1;i<=m;i++)
    {
        in>>x>>y>>c;
        v[x].push_back({c,y});
    }
    bellman(1);
    if(ok==0) for(int i=2;i<=n;i++) out<<d[i]<<" ";
    else out<<"Ciclu negativ!";
    return 0;
}