#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");
const int nmax=50000;
const int oo=1e9;
vector <pair<int,int>> g[nmax+5];
queue <int> currentq,nextq;
int n,m,d[nmax+5];
bool ok=1;
void read(){
    fin>>n>>m;
    for(int i=1;i<=m;++i){
        int x,y,c;
        fin>>x>>y>>c;
        g[x].push_back(make_pair(y,c));
    }
}
void bellmanford(){
    for(int i=2;i<=n;++i)
        d[i]=oo;
    currentq.push(1);
    for(int k=1;k<=n;++k){
        while(!currentq.empty()){
            int i=currentq.front();
            currentq.pop();
            for(auto it:g[i]){
                int vecin=it.first,cost=it.second;
                if(d[vecin]>d[i]+cost){
                    d[vecin]=d[i]+cost;
                    nextq.push(vecin);
                }
            }
            while(!nextq.empty()){
                currentq.push(nextq.front());
                nextq.pop();
            }
        }
    }
    for(int i=1;i<=n;++i)
        for(auto it:g[i]){
            int vecin=it.first,cost=it.second;
            if(d[vecin]>d[i]+cost)
                ok=0;
        }
    if(ok==0){
        fout<<"Ciclu negativ!";
        return;
    }
    for(int i=2;i<=n;++i)
        fout<<d[i]<<" ";

}
int main()
{
    read();
    bellmanford();
    return 0;
}