#include <iostream>
#include <fstream>
#include <bits/stdc++.h>

#define nmax 50010
const int inf = 0x3f3f3f3f;

using namespace std;
ifstream f("bellmanford.in");
ofstream g("bellmanford.out");

vector <pair<int,int>> la[nmax];
int d[nmax];
set <pair<int,int>> s;



int main()
{   int n,m,x,y,c;
    f>>n>>m;

    // Se introduc perechile (nod, cost) in liste de adiacenta
    for(int i=1; i<=m; i++){
        f>>x>>y>>c;
        la[x].push_back(make_pair(y,c));
    }

    // Se seteaza vectorul de distante minime cu inf
    memset(d, inf, sizeof(d));
    d[1]=0;

    // Se adauga nodul de start in set
    s.insert(make_pair(d[1],1));
    long long pas=0;

    while(!s.empty() && pas<nmax*n*m){
        pas++;
        int nod = s.begin()->second;
        int dmin = s.begin()->first;
        s.erase(s.begin());
        // Pentru fiecare vecin al nodului curent se actualizeaza distanta minima
        for(int k=0; k<la[nod].size(); k++){
            int nod2 = la[nod][k].first;
            int cost = la[nod][k].second;
            if(dmin+cost< d[nod2]){
                if(d[nod2] != inf){
                    s.erase(s.find(make_pair(d[nod2], nod2)));
                }
                d[nod2] = dmin+cost;
                s.insert(make_pair(d[nod2], nod2));
            }
        }
    }

    int cn=0;
    for(int i=1; i<=n; i++){
        for(int j=0; j<la[i].size(); j++){
            if(d[i]+ la[i][j].second<d[la[i][j].first]) cn=1;
        }
    }

    // Afisare
    if(cn==1) g<<"Ciclu negativ!";
    else
        for(int l=2; l<=n; l++){
            if(d[l]==inf) g<<0<<" ";
            else g<<d[l]<<" ";
        }

    f.close();
    g.close();
    return 0;
}