#include<cstdio>
#include<queue>
using namespace std;
int i,x1,y1,c1,n,m,INF,dr[50009],ap[50009];
queue < int > cc;
vector < pair < int , int > > v[50009];
vector < pair < int , int > >::iterator it;
int main()
{
freopen("bellmanford.in","r",stdin);
freopen("bellmanford.out","w",stdout);
scanf("%d",&n);
scanf("%d",&m);
INF=1<<30;
for(i=1;i<=m;i++)
{
    scanf("%d",&x1);
    scanf("%d",&y1);
    scanf("%d",&c1);
    v[x1].push_back(make_pair(y1,c1));
}
cc.push(1);
dr[1]=0;
ap[1]=0;
for(i=2;i<=n;i++)
    dr[i]=INF;
while(!cc.empty())
{
    x1=cc.front();
    cc.pop();
    for(it=v[x1].begin();it!=v[x1].end();it++)
        if(dr[it->first]>dr[x1]+it->second)
        {
            dr[it->first]=dr[x1]+it->second;
            ap[it->first]++;
            if(ap[it->first]==n+1)
            {
                printf("Ciclu negativ!\n");
                return 0;
            }
            cc.push(it->first);
        }
}
for(i=2;i<=n;i++)
    printf("%d ",dr[i]);
return 0;
}