#include <iostream>
#include <fstream>
#include <vector>
#include <deque>
#include <string.h>

#define INFINIT 9999999
#define NMax 50005

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();

void BellmanFord()
{
    Queue.push_back(1);
    memset(Dist,INFINIT,sizeof(Dist));
    Dist[1]=0;
    while(!Queue.empty())
    {
        int nod=Queue.front();
        Queue.pop_front();
        for(vector<pair<int,int> >::iterator it=Graf[nod].begin();it!=Graf[nod].end() && Ciclu==false;it++)
            if(Dist[it->first]>Dist[nod]+it->second)
            {
                Dist[it->first]=Dist[nod]+it->second;
                Queue.push_back(it->first);
                C[it->first]++;
                if(C[it->first]>N)
                    Ciclu=true;
            }
    }
}

int main()
{
    Read();
    BellmanFord();
    if(!Ciclu)
        for(int i=2;i<=N;i++)
            fout<<Dist[i]<<" ";
    else
        fout<<"Ciclu negativ!";
    return 0;
}

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));
    }
}