#include <cstdio>
#include <vector>
#include <queue>

const int INF=1000000000;

using namespace std;

struct edge
{
    int nod,cost;
};

vector<edge> v[50010];
int d[50010],vaz[50010],vaz1[50010];
queue<int> q;

int main()
{
    freopen("bellmanford.in","r",stdin);
    freopen("bellmanford.out","w",stdout);
    int n,m,x,y,c,p=0;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d%d",&x,&y,&c);
        v[x].push_back({y,c});
    }
    for(int i=1;i<=n;i++)
        d[i]=INF;
    d[1]=0;
    q.push(1);
    while(!q.empty())
    {
        int nod=q.front();
        q.pop();
        vaz1[nod]=0;
        for(int i=0;i<v[nod].size();i++)
            if(d[nod]+v[nod][i].cost<d[v[nod][i].nod])
            {
                d[v[nod][i].nod]=d[nod]+v[nod][i].cost;
                if(vaz1[v[nod][i].nod]==0)
                {
                    vaz[v[nod][i].nod]++;
                    q.push(v[nod][i].nod);
                    vaz1[v[nod][i].nod]=1;
                    if(vaz[v[nod][i].nod]>n-1) {p=1;break;}
                }
            }
        if(p==1) break;
    }
    if(p==1) printf("Ciclu negativ!");
    else
        for(int i=2;i<=n;i++)
            if(d[i]==INF) printf("0 ");
            else printf("%d ",d[i]);
    return 0;
}