#include <bits/stdc++.h>

using namespace std;

ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");


#define nmax 50005
#define oo (1<<30)
int n,m,x,y,c;
int D[nmax];
vector < pair < int, int >  > G[nmax];


struct cmp
{
    bool operator() (int st,int dr)
    {
        return D[st]>D[dr];


    }


};
int cnt_in_coada[nmax],ciclu_negativ;


priority_queue < int ,vector<int>  , cmp > Q;
bitset < nmax > InCoada;






void Citeste()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        G[x].push_back(make_pair(y,c));
    }

}
void Dijkstra(int nod_start)
{
    for(int i=1;i<=n;i++)
    D[i]=oo;
    D[nod_start]=0;

    InCoada[nod_start]=1;
    Q.push(nod_start);

    while(!Q.empty()  && ciclu_negativ==0)
    {
        int nod_curent = Q.top();
        Q.pop();
        InCoada[nod_curent]=0;

        for(int i=0;i<G[nod_curent].size();i++)
{
    int vecin=G[nod_curent][i].first;
    int cost=G[nod_curent][i].second;

       if(D[vecin]>D[nod_curent]+cost)
       {
           D[vecin]=D[nod_curent]+cost;


           if(InCoada[vecin]==0)
            {
                if(cnt_in_coada[vecin]>n)
                    ciclu_negativ=1;
                else
            {
                InCoada[vecin]=1;
                Q.push(vecin);
                cnt_in_coada[vecin]++;
            }

            }


       }


}




    }



}

void Afisare()
{

    if(ciclu_negativ)
        fout<<"Ciclu negativ!";
    else
    {

    for(int i=2;i<=n;i++)
    if(D[i]==oo)
    fout<<0<<" ";
    else
        fout<<D[i]<<" ";

    }


}

int main()
{
    Citeste();
    Dijkstra(1);
    Afisare();



    return 0;
}