#include <bits/stdc++.h>
using namespace std;

int main() {
    ifstream cin("bellmanford.in");
    ofstream cout("bellmanford.out");
    int n, m;
    cin >> n >> m;
    vector<vector<pair<int, int>>> adj(n + 1);
    for (int i = 0; i < m; i++) {
        int x, y, c;
        cin >> x >> y >> c;
        adj[x].push_back({y, c});
    }
    const long long INF = 1e18;
    vector<long long> dist(n + 1, INF);
    vector<int> in_queue(n + 1), cnt(n + 1);
    queue<int> q;
    dist[1] = 0;
    q.push(1);
    in_queue[1] = 1;
    cnt[1] = 1;
    bool neg = false;
    while (!q.empty() && !neg) {
        int u = q.front();
        q.pop();
        in_queue[u] = 0;
        for (auto [v, c] : adj[u]) {
            if (dist[u] == INF) continue;
            if (dist[u] + c < dist[v]) {
                dist[v] = dist[u] + c;
                if (!in_queue[v]) {
                    q.push(v);
                    in_queue[v] = 1;
                    cnt[v]++;
                    if (cnt[v] >= n) {
                        neg = true;
                        break;
                    }
                }
            }
        }
    }
    if (neg) {
        cout << "Ciclu negativ!";
        return 0;
    }
    for (int i = 2; i <= n; i++) {
        if (dist[i] == INF) cout << 0;
        else cout << dist[i];
        if (i != n) cout << ' ';
    }
    return 0;
}