#include <bits/stdc++.h>

using namespace std;

ifstream in("bellmanford.in");
ofstream out("bellmanford.out");
const int INF = 1<<30;
int dist[50005];
vector< tuple<int,int,int> > edges;

int main()
{
    int n,m;
    in >> n >> m;
    for (int i = 1; i<=m; i++)
    {
        int x,y,val;
        in >> x >> y >> val;
        edges.push_back(make_tuple(x,y,val));
    }
    for (int i = 2; i<=n; i++)
        dist[i] = INF;
    for (int i = 1; i<=n-1; i++)
    {
        for (auto it: edges)
        {
            int x,y,val;
            tie(x,y,val) = it;
            dist[y] = min(dist[y],dist[x]+val);
        }
    }
    bool negative = 0;
    for (auto it: edges)
    {
        int x,y,val;
        tie(x,y,val) = it;
        if (dist[y]>dist[x]+val)
            negative = 1;
    }
    if (negative)
        out << "Ciclu negativ!";
    else
        for (int i = 2; i<=n; i++)
            out << dist[i] << " ";
}