#include <cstdio>
#include <queue>
using namespace std;
int n,m,x,y,c,minn,MAXX=0x3f3f3f3f;
struct muchie
{
    int x,y;
}__attribute__((packed));
int main()
{
    freopen("bellmanford.in","r",stdin);
    freopen("bellmanford.out","w",stdout);
    scanf("%d%d",&n,&m);
    int *d=new int[n+1],*cnt=new int[n+1]{0};
    queue<muchie>q;
    vector<muchie>m1[m+1];
    for(int i=1; i<=m; i++)
    {
        scanf("%d%d%d",&x,&y,&c);
        m1[x].push_back({y,c});
    }
    for(int i=2; i<=n; i++)
        d[i]=MAXX;
    d[1]=0;
    q.push({0,1});
    while(q.size())
    {
        x=q.front().y;
        q.pop();
        for(int i=0; i<m1[x].size(); i++)
        {
            y=m1[x][i].x;
            c=m1[x][i].y;
            if(d[y]>d[x]+c)
            {
                d[y]=d[x]+c;
                cnt[y]++;
                if(cnt[y]>=n)
                {
                    printf("Ciclu negativ!");
                    return 0;
                }
                q.push({d[y],y});
            }
        }
    }
    for(int i=2; i<=n; i++)
        if(d[i])
            printf("%d ",d[i]);
    return 0;
}