#include<cstdio>
#include<vector>
#include<queue>
using namespace std;
#define INF 0x3f3f3f3f
queue <int> q;
vector < pair <int,int> > v[50005];
int n,m,x,y,c,ok,D[50005],viz[50005];
int main()
{
    int i;
    freopen("bellmanford.in","r",stdin);
    freopen("bellmanford.out","w",stdout);
    scanf("%d%d",&n,&m);
    for (i=2;i<=n;++i)
        D[i]=INF;
    for (i=0;i<m;++i)
    {
        scanf("%d%d%d",&x,&y,&c);
        v[x].push_back(make_pair(y,c));
    }
    q.push(1), viz[1]=1;
    while (!q.empty() && !ok)
    {
        x=q.front(), q.pop();
        ++viz[x];
        if (viz[x]>n) ok=1;
        for (i=0;i<v[x].size();++i)
            if (v[x][i].first!=1)
            {
                y=v[x][i].first, c=v[x][i].second;
                if (D[y]>D[x]+c)
                {
                    D[y]=D[x]+c;
                    q.push(y);
                }
            }
    }
    if (ok) printf("Ciclu negativ!");
    else
    for (i=2;i<=n;++i)
        printf("%d ",D[i]);
    printf("\n");
    return 0;
}