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