#include<stdio.h>
#include<stdlib.h>
#define N 50001
typedef struct s
{long p,u,k,e[30*N];}qu;
typedef struct nod
{long co,in;
struct nod *urm;}Nod,*list;
typedef list graf[N];
graf g;
list r;
qu q;
long m,k,d[N],c,n,i,j,v,t,l;

void aQ(qu &q,long x)
{q.k++,q.e[q.u++]=x;}

long dQ(qu &q)
{q.k--,q.p++;
return q.e[q.p-1];}

void push(list &r,long x,long c)
{Nod *p=new Nod;
p->in=x,p->co=c,p->urm=r,r=p;}

int main()
{q.k=q.p=q.u=0;
freopen("bellmanford.in","r",stdin);
freopen("bellmanford.out","w",stdout);
scanf("%ld%ld",&n,&m);
for(i=1;i<=n;i++)
     d[i]=N,g[i]=NULL;
while(m--)
     scanf("%ld%ld%ld",&l,&j,&c),push(g[l],j,c);
d[1]=0,aQ(q,1);
while(q.k)
     {t=dQ(q);
     for(r=g[t];r;r=r->urm)
     if(d[r->in]>d[t]+r->co)
            d[r->in]=d[t]+r->co,aQ(q,r->in);
     else
            if(d[r->in]>0&&d[t]<0)
                  {printf("Ciclu negativ!");
                  return 0;}}
for(v=2;v<=n;v++)
if(d[v]>0)
     printf("%ld ",d[v]%N);
else
     printf("%ld ",d[v]);
return 0;}