/*
https://infoarena.ro/problema/bellmanford
*/
#include <fstream>
#include <vector>

using namespace std;

const int INF = 1e8;

struct arc
{
    int x, y, c;
};

int main()
{
    ifstream in("bellmanford.in");
    ofstream out("bellmanford.out");
    int n, m;
    in >> n >> m;
    vector <arc> e(m);
    for (int i = 0; i < m; i++)
    {
        in >> e[i].x >> e[i].y >> e[i].c;
    }
    in.close();
    vector <int> d(n + 1, INF);
    d[1] = 0;
    bool schimb = true;
    for (int i = 0; i < n - 1 && schimb; i++)
    {
        schimb = false;
        for (auto e_i: e)
        {
            if (d[e_i.x] + e_i.c < d[e_i.y])
            {
                d[e_i.y] = d[e_i.x] + e_i.c;
                schimb = true;
            }
        }
    }
    bool exista_c_n = false;
    for (auto e_i: e)
    {
        if (d[e_i.x] + e_i.c < d[e_i.y])
        {
            exista_c_n = true;
        }
    }
    if (exista_c_n)
    {
        out << "Ciclu negativ!\n";
    }
    else
    {
        for (int x = 2; x <= n; x++)
        {
            out << d[x] << " ";
        }
        out << "\n";
    }
    out.close();
    return 0;
}