#include <bits/stdc++.h>

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

    return 0;
}