#include <bits/stdc++.h>

using namespace std;

ifstream f("bellmanford.in");
ofstream g("bellmanford.out");

struct drumuri{
    int node,cost;
};

struct compare{
    bool operator()(drumuri a,drumuri b){
        return a.cost>b.cost;
    }
};

int n,m,x,y,z,drum[50200],ciclu[50200];
vector <drumuri> edges[50200];
priority_queue <drumuri, vector<drumuri>, compare> pq;

bool bellman()
{
    for(int i=2; i<=n; i++)
        drum[i]=INT_MAX;
    pq.push({1,0});
    while(!pq.empty())
    {
        drumuri x=pq.top();
        pq.pop();
        if(drum[x.node]==x.cost)
            for(auto y:edges[x.node])
                if(x.cost+y.cost<drum[y.node])
                {
                    ciclu[y.node]++;
                    if(ciclu[y.node]>=n)
                        return 1;
                    drum[y.node]=x.cost+y.cost, pq.push({y.node,drum[y.node]});
                }
    }
    return 0;
}

int main()
{
    f>>n>>m;
    for(int i=1; i<=m; i++)
        f>>x>>y>>z, edges[x].push_back({y,z});
    if(bellman())
        g<<"Ciclu negativ!";
    else
        for(int i=2; i<=n; i++)
            g<<drum[i]<<' ';
    return 0;
}