#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");
int n, m, x, y, c, i, j, viz[50001], cycle[50001];
vector <vector <pair<int, int> > > G;
const int oo = 2e8;
bool bf (int v)
{
    queue <int> q;
    q.push(v);
    while (!q.empty())
    {
        v = q.front();
        q.pop();
        cycle[v]++;
        if (cycle[v] > n) return 0;
        for (i = 0; i < G[v].size(); i++)
        {
            y = G[v][i].first;
            c = G[v][i].second;
            if (viz[y] > viz[v]+c)
                viz[y] = viz[v]+c, q.push(y);
        }
    }
    return 1;
}
int main()
{
    fin >> n >> m; G.resize(n+1);
    for (i = 1; i <= m; i++)
    {
        fin >> x >> y >> c;
        G[x].push_back({y, c});
    }
    for (i = 2; i <= n; i++)
        viz[i] = oo;
    if (bf(1))
        for (i = 2; i <= n; i++)
            fout << viz[i] << ' ';
    else fout << "Ciclu negativ!";
    return 0;
}