#include <fstream>
#include <vector>
#include <climits>

using namespace std;

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

struct edge {
    int a, b, cost;
};

int n, m;
vector<edge> edges;
vector<int> dist;

int main() {
    cin >> n >> m;
    dist.resize(n + 2, INT_MAX);
    edges.resize(m + 2);
    for (int i = 0 ; i < m ; ++i) {
        cin >> edges[i].a >> edges[i].b >> edges[i].cost;
    }
    dist[1] = 0;
    for (int i = 1 ; i <= n - 1 ; ++i) {
        for (edge e : edges) {
            if (dist[e.a] + e.cost < dist[e.b]) dist[e.b] = dist[e.a] + e.cost;
        }
    }
    // a n-a iteratie, daca se gaseste o relaxare inseamna ca exista ciclu
    for (edge e : edges) {
        if (dist[e.a] + e.cost < dist[e.b]) {
            cout << "Ciclu negativ!";
            return 0;
        }
    }
    for (int i = 2 ; i <= n ; ++i) {
        cout << dist[i] << " ";
    }
    return 0;
}