#include <bits/stdc++.h>

using namespace std;
ifstream in("bellmanford.in");
ofstream out("bellmanford.out");
int n, m;
queue<int> q;
bool inq[50005];
int cnt[50005];
int d[500005];
vector<pair<int, int>> v[50005];
int x, y, c;

bool bellman(int node) {
    for (int i = 1; i <= n; i++)
        d[i] = 1e9;
    d[node] = 0;

    q.push(node);
    inq[node] = 1;

    while (!q.empty()) {
        int x = q.front();
        q.pop();
        inq[x] = 0;

        for (auto it : v[x]) {
            if (!inq[it.first] && d[it.first] > d[x] + it.second) {
                d[it.first] = d[x] + it.second;
                cnt[it.first]++;
                if (cnt[it.first] > n) {
                    return false;
                }
                inq[it.first] = 1;
                q.push(it.first);
            }
        }
    }

    return true;
}
int main()
{
    in >> n >> m;
    for (int i = 1; i <= m; i++) {
        in >> x >> y >> c;
        v[x].push_back({y, c});
    }

    bool ok = bellman(1);

    if (ok) {
        for (int i = 2; i <= n; i++) {
            out << d[i] << " ";
        }
    } else {
        out << "Ciclu negativ!\n";
    }
    return 0;
}