#include <iostream>
#include <fstream>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <string.h>

#define NMax 50005
#define INF 999999

using namespace std;

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

int N,M;
int Dist[NMax];
int C[NMax];
vector<pair<int,int> > Graf[NMax];
deque<int> Queue;
bool Ciclu;

void Read()
{
    fin>>N>>M;
    for(int i=1;i<=M;i++)
    {
        int from,to,cost;
        fin>>from>>to>>cost;
        Graf[from].push_back(make_pair(to,cost));
    }
}

void BellmanFord(int source)
{
    memset(Dist,INF,sizeof(Dist));
    Dist[source]=0;
    Queue.push_back(source);
    while(!Queue.empty())
    {
        int nod=Queue.front();
        Queue.pop_front();
        for(size_t i=0;i<Graf[nod].size() && Ciclu;i++)
        {
            int to=Graf[nod][i].first;
            int cost=Graf[nod][i].second;
            if(Dist[to]>Dist[nod]+cost)
            {
                Dist[to]=Dist[nod]+cost;
                Queue.push_back(to);
                C[to]++;
                if(C[to]>N)
                    Ciclu=false;
            }
        }
    }
}

void Write()
{
    if(!Ciclu)
        for(int i=2;i<=N;i++)
            fout<<Dist[i]<<" ";
    else
        fout<<"Ciclu negativ!";
}

int main()
{
    Read();
    BellmanFord(1);
    Write();
    return 0;
}