#include<fstream>
#include<vector>
#include<deque>
#include<utility>
# define inf 1000000000
using namespace std;
vector <pair <int, int> > L[50003];
int n, m, i, D[50003], x, y, val, v[50003], nr[50003], nod, vecin, ok;
deque <int> q;
ifstream in("bellmanford.in");
ofstream out("bellmanford.out");
int main()
{

    in>>n>>m;
    for(i=1; i<=m; i++)
    {
        in>>x>>y>>val;
        L[x].push_back(make_pair(y, val));
    }

    for(i=2; i<=n; i++)
        D[i]=inf;
    q.push_back(1);
    v[1]=1;
    nr[1]=1;
    while(!q.empty())
    {
        nod=*q.begin();
        for(i=0; i<L[nod].size(); i++)
        {
            vecin=L[nod][i].first;
            if(D[vecin]>D[nod]+L[nod][i].second)
            {
                D[vecin]=D[nod]+L[nod][i].second;
                if(v[vecin]==0)
                {
                    q.push_back(vecin);
                    nr[vecin]++;
                    v[vecin]=1;
                    if(nr[nod]==n)
                    {
                        ok=1;
                        break;
                    }
                }
            }
        }
        v[nod]=0;
        q.pop_front();
        if(ok)
            break;
    }
    if(ok)
        out<<"Ciclu negativ!\n";
    else
        for(i=2; i<=n; i++)
            out<<D[i]<<" ";
    return 0;
}