#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define sz() size()
#define fr first
#define sc second
//#define int long long
#define mp make_pair
#define rc(s) return cout<<s,0
#define rcc(s) cout<<s,exit(0)
using namespace std;

const int inf = 1e9;
const int nmax = 50005;

int n,m,dist[nmax];
vector<pair<int,int>>nod[nmax];
queue<int>Q;
vector<int>tz;
bitset<nmax>viz;

int32_t main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
    srand(chrono::steady_clock::now().time_since_epoch().count());
    ifstream cin("bellmanford.in");
    ofstream cout("bellmanford.out");
    cin >> n >> m;
    for(int i=1;i<=m;i++){
        int x,y,z;
        cin >> x >> y >> z;
        nod[x].push_back({y,z});
    }
    Q.push(1);
    for(int i=2;i<=n;i++) dist[i] = inf;
    for(int i=1;i<n;i++){
        while(Q.size()){
            int x = Q.front();
            for(auto it : nod[x]){
                if(dist[x] + it.sc < dist[it.fr]){
                    dist[it.fr] = dist[x] + it.sc;
                    if(viz[it.fr] == 0)tz.push_back(it.fr);
                    viz[it.fr] = 1;
                }
            }
            Q.pop();
        }
        for(auto it : tz) Q.push(it);
        tz.clear();
    }
    if(Q.size()){
        cout << "Ciclu negativ!" << '\n';
        return 0;
    }
    for(int i=2;i<=n;i++) cout << dist[i] << ' ';
}