#include<cstdio>
#include<vector>
#include<utility>
#include<iterator>
#include<algorithm>
#define NMAX 50000+5
#define MMAX 250000+5
#define oo 1<<30
using namespace std;
vector<pair<int,int> > V[NMAX];
vector<pair<int,int> >::iterator it;
int N,M,x,y,c,i,j;
int costs[NMAX];
int bf()
{
    for(i=1; i<=N; i++)
        for(j=1; j<=N; j++)
            for(it=V[j].begin(); it!=V[j].end(); it++)
                costs[it->first]=min(costs[it->first],costs[j]+it->second);
    for(j=1; j<=N; j++)
        for(it=V[j].begin(); it!=V[j].end(); it++)
            if(costs[it->first]>costs[j]+it->second) return 0;
    return 1;
}
int main()
{
    freopen("bellmanford.in","r",stdin);
    freopen("bellmanford.out","w",stdout);
    scanf("%d%d",&N,&M);
    for(; M; --M)
    {
        scanf("%d%d%d",&x,&y,&c);
        V[x].push_back(make_pair(y,c));
    }
    for(i=2; i<=N; i++) costs[i]=oo;
    for(it=V[1].begin(); it!=V[1].end(); it++) costs[it->first]=min(costs[it->first],it->second);
    if(bf()==0) printf("Ciclu negativ!\n");
    else for(i=2; i<=N; i++) printf("%d ",costs[i]);
    return 0;
}