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

using namespace std;

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

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

int main() {

    int n, m;
    in >> n >> m;
    vector<Edge> e(m);
    for(int i = 0; i < m; i ++)
        in >> e[i].x >> e[i].y >> e[i].c;

    vector<int> dist(n + 1, INT_MAX);
    dist[1] = 0;
    for(int step = 1; step < n; step ++)
        for(auto it : e)
            if(dist[it.x] < dist[it.y] - it.c)
                dist[it.y] = dist[it.x] + it.c;

    ///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;
}