#include <bits/stdc++.h>
using namespace std;
ifstream f("bellmanford.in");
ofstream g("bellmanford.out");
// #define f cin
// #define g cout
const int inf = (1 << 30);
struct edge
{
    int from, to, cost;
    friend istream &operator>>(istream &is, edge &x)
    {
        is >> x.from >> x.to >> x.cost;
        return is;
    }
} v[250002];
int n, m, ok, ax[50001];
int main()
{
    f >> n >> m;
    for (int i = 2; i <= n; i++)
        ax[i] = inf;
    for (int i = 1; i <= m; i++)
        f >> v[i];
    for (int unused = 0; unused <= n; unused++)
    {
        ok = 0;
        for (int i = 1; i <= m; i++)
            if (ax[v[i].from] != inf)
                if (ax[v[i].to] > ax[v[i].from] + v[i].cost)
                {
                    ok = 1;
                    ax[v[i].to] = max(-inf, ax[v[i].from] + v[i].cost);
                }
        if (!ok)
            break;
    }
    if (ok)
        g << "Ciclu negativ!";
    else
    {
        for (int i = 2; i <= n; i++)
            g << ax[i] << " ";
    }

    return 0;
}