#include <bits/stdc++.h>

using namespace std;

const int NMAX = 5e4,INF = 2e9;
int dist[NMAX + 5],cnt[NMAX + 5];
bool viz[NMAX + 5];
int n,a,b,c,ok;
vector <pair <int, int> > edges[NMAX + 5];
queue <int> q;

bool bellman_ford() {
    q.push(1);
    viz[1] = 1;
    cnt[1] = 1;
    ok = 0;
    while (!q.empty() && !ok) {
        a = q.front();
        q.pop();
        viz[a] = 0;
        for (int i = 0;i < edges[a].size();i++) {
            b = edges[a][i].first;
            c = edges[a][i].second;
            if (c + dist[a] < dist[b]) {
                dist[b] = c + dist[a];
                if (!viz[b]) {
                    viz[b] = 1;
                    cnt[b]++;
                    if (cnt[b] > n)
                        ok = 1;
                    q.push(b);
                }
            }
        }
    }
    return ok;
}
int main()
{
    ifstream fin("bellmanford.in");
    ofstream fout("bellmanford.out");
    int m;
    fin >> n >> m;
    for (int i = 0;i < m;i++) {
        fin >> a >> b >> c;
        edges[a].push_back({b, c});
    }
    dist[1] = 0;
    for (int i = 2;i <= n;i++)
        dist[i] = INF;
    if (bellman_ford())
        fout << "Ciclu negativ!";
    else {
        for (int i = 2;i <= n;i++)
            fout << dist[i] << ' ';
    }
    return 0;
}