#include <fstream>
#include <vector>
#define NMAX 50002
#define INF 1000000000
#include <queue>
using namespace std;
ifstream fin ("bellmanford.in");
ofstream fout ("bellmanford.out");
struct varf
{
    int x;
    int c;
};
int n, x0=1;
vector<varf> G[NMAX];///liste de adiacenta cu costuri
bool uz[NMAX];
int pre[NMAX];///reconstitui drumurile de cost minim
int cmin[NMAX];///vectoruol de costuri minime
int nr[NMAX]; ///nr[i] nr de drumuri de cost minim
int afis[NMAX];
queue<int> C;///goala pusca

bool rez;
void citire();
bool bellmanford();
void afisare();
int main()
{
    citire();
    rez=bellmanford();
    afisare();
    return 0;
}

void citire()
{int i, j, c, m;
    fin>>n>>m;
    varf aux;
    while (fin>>i>>j>>c)
    {
        ///in lista de adiacenta a lui i trebuie sa adaug perechea (j, c)
        aux.x=j;
        aux.c=c;
        G[i].push_back(aux);
    }
    for (i=1; i<=n; i++) cmin[i]=INF;
    cmin[x0]=0;
}

bool bellmanford()
{int x, vf, cost, i;
    ///returneaza 0 daca exista circuite de cont negativ 1 altfel
    ///initializez coada cu vf de start
    C.push(x0);
    nr[x0]=1;
    while (!C.empty())
        {
        x=C.front(); C.pop();
        ///parcurg lista de adiacenta a lui x
        for (i=0; i<G[x].size(); i++)
            {
            vf=G[x][i].x; cost=G[x][i].c;
            if (cmin[vf]>cmin[x]+cost)
                {
                cmin[vf]=cmin[x]+cost;
                C.push(vf);
                nr[vf]++;
                if (nr[vf]==n) return 0;

                }
            }
        }
return 1;
}

void afisare()
{int i, j, cnt;
if (rez==0) fout<<"Ciclu negativ!";
    else
    for (i=2; i<=n; i++) fout<<cmin[i]<<' ';
    fout<<endl;



}