#include <bits/stdc++.h>
#define NMAX 50000
#define VMAX 2000000000

using namespace std;

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

int n, m, a, b, c;
vector<pair<int, int>> graf[NMAX + 2];
vector<int> dist(NMAX + 2, VMAX), cnt(NMAX + 2);
queue<int> q;

int main() {
    ios_base::sync_with_stdio(false);
    fin.tie(NULL);
    fout.tie(NULL);

    fin >> n >> m;
    while (m--) {
        fin >> a >> b >> c;
        graf[a].push_back({b, c});
    }

    dist[1] = 0;
    q.push(1);

    while (!q.empty()) {
        int nod = q.front();
        q.pop();

        for (pair<int, int> it : graf[nod]) {
            int vec = it.first;
            int cost = it.second;
            if (dist[nod] + cost < dist[vec]) {
                dist[vec] = dist[nod] + cost;
                q.push(vec);

                cnt[vec]++;
                if (cnt[vec] >= n) {
                    fout << "Ciclu negativ!";
                    return 0;
                }
            }
        }
    }

    for (int i = 2; i <= n; i++) {
        fout << dist[i] << ' ';
    }
    return 0;
}