#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <bitset>
#include <algorithm>

#define costMaxim 2000
#define numarNoduriMaxim 50005

using namespace std;

vector< pair<int, int> > listaAdiacenta[numarNoduriMaxim];
vector<int> listaAdiacentaAux[numarNoduriMaxim];

int main()
{
    ifstream in("bellmanford.in");

    int numarNoduri;
    int numarMuchii;

    in>> numarNoduri>> numarMuchii;

    for( int i = 0, nod1, nod2, cost; i<numarMuchii; ++i )
    {
        in>> nod1>> nod2>> cost;

        listaAdiacenta[nod1].push_back(make_pair(nod2, cost));

        if( find(listaAdiacentaAux[nod1].begin(), listaAdiacentaAux[nod1].end(), nod2) == listaAdiacentaAux[nod1].end() )
        {
            listaAdiacentaAux[nod1].push_back(nod2);
        }
    }
    in.close();

    queue<int> tail;
    bitset<numarNoduriMaxim> existaInTail(false);
    vector<int> distanta(numarNoduri + 1, costMaxim);
    vector<int> numarParcurgeriNod(numarNoduri + 1, 0);

    distanta[1] = 0;
    tail.push(1);
    existaInTail[1].flip();

    bool existaCicluNegativ = false;

    while( !tail.empty() && !existaCicluNegativ )
    {
        int nod = tail.front();
        tail.pop();

        existaInTail[nod] = false;

        for( auto &it : listaAdiacenta[nod] )
        {
            if( distanta[nod] < costMaxim )
            {
                if( distanta[it.first] > distanta[nod] + it.second )
                {
                    distanta[it.first] = distanta[nod] + it.second;

                    if( !existaInTail[it.first] )
                    {
                        if( numarParcurgeriNod[it.first] > numarNoduri )
                        {
                            existaCicluNegativ = true;
                            break;
                        }
                        else
                        {
                            tail.push(it.first);
                            existaInTail[it.first] = true;
                            ++numarParcurgeriNod[it.first];
                        }
                    }
                }
            }
        }
    }

    ofstream out("bellmanford.out");
    if( !existaCicluNegativ )
    {
        for( int i = 2; i<= numarNoduri; ++i )
        {
            out<< distanta[i]<<" ";
        }
    }
    else
    {
        out<< "Ciclu negativ!";
    }
    out.close();

    return 0;
}