#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <queue>
#include <climits>

using namespace std;

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

struct Edge {
    int x, y;
    long long c;
};

int main() {

    int n, m;
    in >> n >> m;
    vector<vector<pair<int, long long>>> g(n + 1);
    vector<Edge> e(m);
    for(int i = 0; i < m; i ++) {
        int x, y, c;
        in >> x >> y >> c;
        g[x].push_back({y, c});
        e[i] = {x, y, c};
    }

    vector<long long> dist(n + 1, INT_MAX);
    dist[1] = 0;
    queue<int> q;
    q.push(1);

    int nsteps = 0;
    while(q.size() && nsteps < n * m) {
        nsteps ++;
        int node = q.front();
        q.pop();

        for(auto it : g[node])
            if(dist[node] < dist[it.first] - it.second) {
                dist[it.first] = dist[node] + it.second;
                q.push(it.first);
            }
    }
    ///verific daca am ciclu negativ
    bool flag = 0;
    for(auto it : e)
        if(dist[it.x] < dist[it.y] - it.c) {
            flag = 1;
            break;
        }
    if(flag)
        out << "Ciclu negativ!";
    else
        for(int i = 2; i <= n; i ++)
            out << dist[i] << " ";

    return 0;
}