#include <iostream>
#include <fstream>
#include <algorithm>
#include <bitset>
#include <cstdio>
#include <vector>
#include <cmath>
#include <queue>
#include <string>
#include <cstring>
#include <map>
#include <set>


#define DN 50005
#define pb push_back
#define mp make_pair
#define per pair<int,int>
#define INF (1<<30)
#define LL long long
#define un unsigned
#define x first
#define y second
using namespace std;


int dp[DN],cnt[DN],n,m;
queue <int> q;
vector< per > list[DN];

bool bfs(int nod)
{
    q.push(nod);
    memset(dp,127,sizeof(dp));
    dp[1]=0;
    bool ciclu_negativ = false;
    for(; q.size() && !ciclu_negativ ; ){

        int nod = q.front();
        q.pop();
        for(int i=0;i<list[nod].size();++i){

            int next_nod = list[nod][i].x;
            int cost = list[nod][i].y;
            if( dp[next_nod] > dp[nod] + cost ){

                dp[next_nod] = dp[nod] + cost;
                q.push(next_nod);
                ++cnt[next_nod];
                if(cnt[next_nod] > n)
                    ciclu_negativ = true;
            }

        }
    }
    return ciclu_negativ;
}


int main()
{
    ifstream f("bellmanford.in");
    ofstream g("bellmanford.out");
    f>>n>>m;
    for(;m--;){
        int a,b,c;
        f>>a>>b>>c;
        list[a].pb(mp(b,c));
    }
    bool ok = bfs(1);

    if(!ok)
        for(int i=2;i<=n;++i)
            g<<dp[i]<<" ";
            else
                g<<"Ciclu negativ!";

    return 0;
}