#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
using namespace std;

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

const int NMAX = 50001;
const int INF = 1000000000;

struct graph {
    int n,c;
} aux;
int n,m,dist[NMAX],vc[NMAX],negcycle;
vector <graph> g[NMAX];
queue <int> q;

void bellmanford(int node) {
    q.push(node);
    vc[node]++;
    while(!q.empty() && negcycle==0) {
        node=q.front();
        q.pop();
        vc[node]--;
        for(int i=0; i<g[node].size(); i++) {
            aux=g[node][i];
            if(dist[aux.n]>dist[node]+aux.c) {
                vc[aux.n]++;
                dist[aux.n]=dist[node]+aux.c;
                q.push(aux.n);
                if(vc[aux.n]>=n)
                    negcycle=1;
            }
        }
    }
}
int main() {
    fin>>n>>m;
    for(int i=1; i<=m; i++) {
        int x,y,c;
        fin>>x>>y>>c;
        aux.n=y;
        aux.c=c;
        g[x].push_back(aux);
    }
    for(int i=1; i<=n; i++)
        dist[i]=INF;
    dist[1]=0;
    bellmanford(1);
    if(negcycle==1) {
        fout<<"Ciclu negativ!";
    } else {
        for(int i=2;i<=n;i++)
            fout<<dist[i]<<" ";
    }
    return 0;
}