#include <fstream>
#include <algorithm>
#include <vector>
#include <queue>
#define NMAX 50005
#define inf 2000000000

using namespace std;

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

int used[NMAX], d[NMAX], i, j, n, m, x, y, cost;
bool exista = 0;
vector < pair < int, int > > v[NMAX];
queue < int > q;

void bellman()
{
    q.push(1);
    d[1] = 0;

    for (int i = 2; i <= n; ++ i)
        d[i] = inf;

    while (!q.empty())
    {
        int curr = q.front();
        q.pop();

        for (auto & it : v[curr])
            if (d[it.first] > d[curr] + it.second)
        {
            if (used[it.first] > n)
                exista = 1;
            else
            {
                used[it.first] ++;
                d[it.first] = d[curr] + it.second;
                q.push(it.first);
            }
        }
    }
}

int main()
{
    f >> n >> m;

    for (i = 1; i <= m; ++ i)
    {
        f >> x >> y >> cost;
        v[x].push_back(make_pair(y, cost));
    }

    bellman();

    if (exista)
    {
        g << "Ciclu negativ!" << '\n';
        return 0;
    }

    for (i = 2; i <= n; ++ i)
        if (d[i] == inf)
            g << 0 << " ";
        else
            g << d[i] << " ";
    return 0;
}