#include <bits/stdc++.h>
#define nmax 50001
#define oo  LONG_MAX
using namespace std;
ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");
int n,m,viz[nmax],d[nmax],cnt[nmax];
vector<pair<int,int> >L[nmax];
queue<int>c;
void Citire()
{
    int i,x,y,cost;
    fin>>n>>m;
    for(i=1; i<=m; i++)
    {
        fin>>x>>y>>cost;
        L[x].push_back({y,cost});
    }
}
void Bellmanford()
{
    int i,p,q,x;
    bool negativ;
    negativ=true;
    for(i=2; i<=n; i++)
        d[i]=oo;
    c.push(1);
    viz[1]=1;
    ///spre deosebire de algoritmul lui Dijkstra  care foloseste fiecare nod 1(folosind priority_queue),algoritmul lui BellmanFord parcurge fiecare nod n ori.
    ///Cand gasim un nod vizitat de n+1 ori inseamna ca exista un ciclu negativ
    while(!c.empty() && negativ)
    {
        x=c.front();
        c.pop();
        viz[x]=0;
        for(i=0; i<L[x].size(); i++)
        {
            p=L[x][i].first;
            q=L[x][i].second;
            if(d[p]>d[x]+q)
            {
                d[p]=d[x]+q;
                if(!viz[p])
                {
                    if(cnt[p]>n)
                        negativ=false;
                    else
                    {
                        cnt[p]++;
                        viz[p]=1;
                        c.push(p);
                    }
                }
            }
        }
    }
    if(!negativ)
        fout<<"Ciclu Negativ!\n";
    else
    {
        for(i=2;i<=n;i++)
            fout<<d[i]<<" ";
        fout<<"\n";
    }
}
int main()
{
    Citire();
    Bellmanford();
    fin.close();
    fout.close();
    return 0;
}