#include <bits/stdc++.h>

using namespace std;

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

const int NMAX = 50005;
const int INF = (1<<29);

vector < pair<int,int> > v[NMAX];
queue <int> q;
int dist[NMAX],fr[NMAX];
int n,m,x,y,cost;

void citire(){
    fin >> n >> m;
    for(int i=1;i<=m;i++){
        fin >> x >> y >> cost;
        v[x].push_back({y,cost});
    }
}

void solve(){
    for(int i=1;i<=n;i++) dist[i]=INF;
    q.push(1);
    dist[1]=0;
    while(!q.empty()){
        int node = q.front();
        q.pop();
        if(fr[node]>=n){
            fout << "Ciclu negativ!" << '\n';
            return;
        }
        fr[node]++;
        for(int i=0;i<v[node].size();i++){
            int vecin=v[node][i].first;
            int cost_vecin=v[node][i].second;
            if(dist[vecin]>dist[node]+cost_vecin){
                dist[vecin]=dist[node]+cost_vecin;
                q.push(vecin);
            }
        }
    }
    for(int i=2;i<=n;i++)
        fout << dist[i] << ' ';
}

int main()
{
    citire();
    solve();
    return 0;
}