#include <bits/stdc++.h>

using namespace std;

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

const int DIM = 50000 + 5;

vector < pair < int, int > > a[DIM];

int f[DIM];
bool in[DIM];

void bfs(int k, int n)
{
    queue < int > q;
    vector < int > d(DIM, 2e9);
    d[k] = 0;
    q.push(k);
    while(!q.empty()) {
        int x = q.front();
        q.pop();
        ++f[x];
        if(f[x] == n) {
            fout << "Ciclu negativ!" << "\n";
            exit(0);
        }
        in[x] = false;
        for(auto v : a[x]) {
            int to = v.first;
            int len = v.second;
            if(d[to] > d[x] + len) {
                d[to] = d[x] + len;
                if(in[to] == false) in[to] = true, q.push(to);
            }
        }
    }
    for(int i = 2; i <= n; ++i) fout << d[i] << " ";
}

int main()
{
    int n, m;

    fin >> n >> m;
    for(int i = 1; i <= m; ++i) {
        int x, y, w;

        fin >> x >> y >> w;
        a[x].push_back({y, w});
    }
    bfs(1, n);
    return 0;
}