#include <fstream>
#include <vector>
#include <queue>
#define nmax (int)(5e4+1)
#define inf 1e9
using namespace std;
ifstream cin("bellmanford.in");
ofstream cout("bellmanford.out");
int n,m,x,y,c,ciclu[nmax],dp[nmax];
vector<pair<int,int>>v[nmax];
bool in[nmax];
queue<int>q;
bool bellman(){
    for(int i=2;i<=n;i++)
        dp[i]=inf;
    q.push(1);
    ciclu[1]=1;
    in[1]=1;
    while(!q.empty()){
        int nod=q.front();
        q.pop();
        in[nod]=0;
        for(auto i:v[nod])
            if(dp[i.first]>dp[nod]+i.second){
                ciclu[i.first]++;
                if(ciclu[i.first]>=n)
                    return 0;
                dp[i.first]=dp[nod]+i.second;
                if(!in[i.first])
                    q.push(i.first);
                in[i.first]=1;
            }
    }
    return 1;
}
signed main()
{
    cin>>n>>m;
    for(int i=1;i<=m;i++){
        cin>>x>>y>>c;
        v[x].push_back({y,c});
    }
    if(!bellman()){
        cout<<"Ciclu negativ!";
        return 0;
    }
    for(int i=2;i<=n;i++)
        cout<<dp[i]<<" ";
    return 0;
}