#include <cstdio>
#include <queue>
#include <vector>
#define INFINIT 1<<30
#define MAXN 50010
using namespace std;
vector<int> d;
struct nod{int nd; int cost; nod *next;};
nod *L[MAXN];
int n, S, m, uz[MAXN], C[MAXN], ciclu_negativ;
struct Comp{
bool operator() (int i, int j)
{
    return d[i]<d[j];
}
};
queue<int> Q;
void citire()
{
    nod *p;
    int x, y, cost,i;
    scanf("%d%d", &n, &m);
    for(i=1;i<=m;++i)
    {
        scanf("%d%d%d", &x, &y, &cost);
        p=new nod;
        p->nd=y;
        p->cost=cost;
        p->next=L[x];
        L[x]=p;
    }
    S=1;
}
void Dijkstra()
{
    d.assign(n+1, INFINIT);
    d[S]=0;
    uz[S]=1;
    C[S]=1;
    Q.push(S);
    int k;
    while(!Q.empty()&&!ciclu_negativ)
    {
        k=Q.front();
        Q.pop();
        uz[k]=0;
        nod *p=L[k];
        while(p)
        {
            if(d[p->nd]>d[k]+p->cost)
            {
                d[p->nd]=d[k]+p->cost;
                if(!uz[p->nd])
                {
                    if(C[p->nd]>n)
                        ciclu_negativ=1;
                    else
                    {
                        Q.push(p->nd);
                        uz[p->nd]=1;
                        C[p->nd]++;
                    }
                }
            }
            p=p->next;
        }
    }
}
void afisare()
{
    if(ciclu_negativ)
        printf("Ciclu negativ!\n");
    else
    {
        int i;
        for(i=2;i<=n;++i)
            if(d[i]!=INFINIT)
                printf("%d ", d[i]);
            else
                printf("0 ");
    }
}
void rezolva_problema()
{
    citire();
    Dijkstra();
    afisare();
}
int main()
{
    freopen("bellmanford.in", "r", stdin);
    freopen("bellmanford.out", "w", stdout);
    rezolva_problema();
    return 0;
}