#include<stdio.h>
#include<stdlib.h>
#define N 50001
#define M 1500000
typedef struct s
{long prim,ultim,nel,elem[M];}queue;
typedef struct nod
{long cost,info;
struct nod *urm;}Nod,*list;
typedef list graf[N];
graf g;
list r;
queue q;
long m,k,d[N],co,n,i,j,p,t,l;

void addQ(queue &q,long x)
{q.nel++;
q.elem[q.ultim++]=x;}
       
long delQ(queue &q)
{q.nel--;
q.prim++;
return q.elem[q.prim-1];}

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

int main()
{q.nel=q.prim=q.ultim=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;}
for(k=1;k<=m;k++)
      {scanf("%ld%ld%ld",&l,&j,&co);
      push(g[l],j,co);}
d[1]=0;
addQ(q,1);
while(q.nel!=0)
      {t=delQ(q);
      for(r=g[t];r!=NULL;r=r->urm)
      if(d[r->info]>d[t]+r->cost)
            {d[r->info]=d[t]+r->cost;
            addQ(q,r->info);}
      else
            if(d[r->info]>0&&d[t]<0)
                    {printf("Ciclu negativ!");
                    return 0;}}
for(p=2;p<=n;p++)
if(d[p]>0)
      printf("%ld ",d[p]%N);
else
      printf("%ld ",d[p]);
fclose(stdin);
fclose(stdout);
return 0;}