#include <bits/stdc++.h>
using namespace std;
vector <pair<int,int> > graf[50002];
queue <int> coada;
int d[50002],viz[50002];
int n,m,fiu,cost,nod,a,b,c;
int bellmanford(int start)
{
    coada.push(start);
    viz[start]++;
    while(!coada.empty())
    {
        nod=coada.front();
        coada.pop();
        for(int i=0;i<graf[nod].size();i++)
        {
            fiu=graf[nod][i].first;
            cost=graf[nod][i].second;
            if(d[fiu]>d[nod]+cost)
            {
                d[fiu]=d[nod]+cost;
                viz[fiu]++;
                coada.push(fiu);
                if(viz[fiu]>n)
                    return 1;
            }
        }
    }
    return 0;
}
int main()
{
    ifstream in("bellmanford.in");
    ofstream out("bellmanford.out");
    in>>n>>m;
    for(int i=1;i<=m;i++)
    {
        in>>a>>b>>c;
        graf[a].push_back(make_pair(b,c));
    }
    for(int i=2;i<=n;i++)
    {
        d[i]=10000000;
    }
    if(bellmanford(1))
        out<<"Ciclu negativ!";
    else
    {
        for(int i=2;i<=n;i++)
        {
            out<<d[i]<<" ";
        }
    }
    return 0;
}