#include <bits/stdc++.h>

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

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

    vector<int> d(n + 1, 1e9);
    d[1] = 0;
    q.push(1);
    inq[1] = 1;

    while (!q.empty()) {
        int nod = q.front();
        q.pop();
        inq[nod] = 0;
        for (auto it : adj[nod]) {
            if (d[it.second] > d[nod] + it.first) {
                d[it.second] = d[nod] + it.first;
                cnt[it.second]++;
                if (cnt[it.second] > n) {
                    out << "Ciclu negativ!";
                    return 0;
                }

                if (!inq[it.second]) {
                    q.push(it.second);
                    inq[it.second] = 1;
                }
            }
        }
    }

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