#include<stdio.h>
#include<vector>
using namespace std;
#define nmax 50005
#define inf nmax*1000
struct element{long n, c;};
long a, b, c, inc, n, m, i, x;
long dmin[nmax];
vector <element> ma[nmax];
vector <element> ::iterator it;
vector <long> co;
element el;
bool ok;

void citire()
{
    scanf("%ld %ld",&n,&m);
    for (i=1;i<=m;i++)
    {
        scanf("%ld %ld %ld",&a,&b,&c);
        el.n=b; el.c=c; ma[a].push_back(el);
    }
}

void rezolvare()
{
    for (i=1;i<=n;i++)
        dmin[i]=inf;
    dmin[1]=0;
    co.push_back(1);
    while (inc<co.size())
    {
        x=co[inc]; inc++;
        for (it=ma[x].begin();it!=ma[x].end();it++)
            if (dmin[(*it).n]>dmin[x]+(*it).c)
            {
                dmin[(*it).n]=dmin[x]+(*it).c;
                co.push_back((*it).n);
            }
        if (co.size()>n*m)
            break;
    }
    ok=1;
    for (i=1;i<=n;i++)
        for (it=ma[i].begin();it!=ma[i].end();it++)
            if (dmin[(*it).n]>dmin[i]+(*it).c)
                ok=0;
}

int main()
{
    freopen("bellmanford.in","r",stdin);
    freopen("bellmanford.out","w",stdout);
    citire();
    rezolvare();
    if (!ok)
        printf("Ciclu negativ!\n");
    else
        for (i=2;i<=n;i++)
            printf("%ld ",dmin[i]);
    return 0;
}