#include <bits/stdc++.h>

using namespace std;

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

void usain_bolt()
{
    ios::sync_with_stdio(false);
    fin.tie(0);
}

const int N = 5e4 + 5;

vector < pair < int, int > >  a[N];
queue < int > q;

int f[N];
bool in[N];

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

int main()
{
    usain_bolt();

    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});
    }
    bellmanford(1, n);
    return 0;
}