#include <bits/stdc++.h>

#define NMax 50005

using namespace std;

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

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

void BellmanFord(int source)
{
    for(int i=1;i<=N;i++)
        Dist[i]=1<<30;
    Dist[source]=0;
    Queue.push_front(source);
    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++)
        {
            int vec=it->first;
            int cost=it->second;
            if(Dist[vec]>Dist[nod]+cost)
            {
                Dist[vec]=Dist[nod]+cost;
                Queue.push_back(vec);
                C[vec]++;
                if(C[vec]>N)
                    Ciclu=true;
            }
        }
    }
}

int main()
{
    fin>>N>>M;
    for(int i=1;i<=M;i++)
    {
        int x,y,z;
        fin>>x>>y>>z;
        Graf[x].push_back(make_pair(y,z));
    }
    BellmanFord(1);
    if(!Ciclu)
        for(int i=2;i<=N;i++)
            fout<<Dist[i]<<" ";
    else
        fout<<"Ciclu negativ!";

    return 0;
}