#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho
#define ll long long
#define double long double
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define aint(a) (a).begin(), (a).end()
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000000007
#define PI 3.14159265359
#define INF 1000000005
#define LINF 1000000000000000005ll
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
ll n,m,d[500005],cnt[500005];
vector<pair<ll,ll>>g[50005];
int32_t main(){
CODE_START;
ifstream cin("bellmanford.in");
ofstream cout("bellmanford.out");
cin>>n>>m;
for(ll i=1;i<=m;i++)
{
    ll x,y,z;
    cin>>x>>y>>z;
    g[x].pb(mp(y,z));
}
for(ll i=1;i<=n;i++)
{
    d[i]=LINF;
}
queue<ll>q;
q.push(1);
bitset<50005>viz(false);
viz[1].flip();
ll check=0;
d[1]=0;
while(!q.empty()&&!check){
    ll node=q.front();
    q.pop();
    viz[node]=false;
    for(auto it : g[node]){
        if(d[it.f]>d[node]+it.s&&d[node]<LINF){
d[it.f]=d[node]+it.s;
        if(viz[it.f]==0){
        if(cnt[it.f]>n){
            check=1;
        }else {
        q.push(it.f);
        cnt[it.f]++;
        viz[it.f]=true;
        }
        }
        }
    }
}
if(check==1){
        cout<<"Ciclu negativ!"<<endl;
}else {
for(ll i=2;i<=n;i++)
{
    cout<<d[i]<<' ';
}
}
}