#include <bits/stdc++.h>

using namespace std;

const int NMAX = 50009;
const int INF = 999999999;

ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");

int n, m, cost, x, y, d[NMAX], inque[NMAX], cnt[NMAX];

vector<pair<int, int>> g[NMAX];

queue<int> q;

int main()
{
    fin >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        fin >> x >> y >> cost;
        g[x].push_back(make_pair(y, cost));
    }
    d[1] = 0;
    for(int i = 2; i <= n; i++)
        d[i] = INF;
    q.push(1);
    inque[1] = 1;

    while(!q.empty())
    {
        int nod = q.front();
        q.pop();
        inque[nod] = 0;
        for(int i = 0; i < g[nod].size(); i++)
        {
            int vecin = g[nod][i].first;
            int cost = g[nod][i].second;
            if(d[vecin] > d[nod] + cost)
            {
                d[vecin] = d[nod] + cost;
                cnt[vecin]++;
                if(cnt[vecin] == n) {fout << "Ciclu negativ!"; return 0;}
                if(inque[vecin] == 0)
                {
                    inque[vecin] = 1;
                    q.push(vecin);
                }

            }
        }
    }
    for(int i = 2; i <= n; i++)
        fout << d[i] << " ";
    return 0;
}