#include<algorithm>
#include<bitset>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<deque>
#include<fstream>
#include<iomanip>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vector>

using namespace std;

#ifdef HOME
const string inputFile = "input.txt";
const string outputFile = "output.txt";
#else
const string problemName = "bellmanford";
const string inputFile = problemName + ".in";
const string outputFile = problemName + ".out";
#endif

typedef pair<int, int> PII;
const int NMAX = 50000 + 5;
const int INF = (1 << 29);

int N, M;
int dist[NMAX];
int cnt[NMAX];
bitset<NMAX> viz;
deque<int> Q;
vector<PII> V[NMAX];

int bf(int x) {
    int i, y, z;

    viz = 0;
    Q.clear();

    for(i = 1; i <= N; i++)
        dist[i] = INF;

    dist[x] = 0;
    viz[x] = 1;
    Q.push_back(x);

    while(!Q.empty()) {
        x = Q.front();
        Q.pop_front();
        viz[x] = 0;

        cnt[x]++;

        if(cnt[x] >= N)
            return 0;

        for(auto nod : V[x]) {
            y = nod.first;
            z = nod.second;

            if(dist[x] + z < dist[y]) {
                dist[y] = dist[x] + z;

                if(!viz[y]) {
                    viz[y] = 1;
                    Q.push_back(y);
                }
            }
        }
    }

    return 1;
}

int main() {
    int i, x, y, z;

#ifndef ONLINE_JUDGE
    freopen(inputFile.c_str(), "r", stdin);
    freopen(outputFile.c_str(), "w", stdout);
#endif

    scanf("%d%d", &N, &M);

    while(M--) {
        scanf("%d%d%d", &x, &y, &z);
        V[x].push_back(make_pair(y, z));
    }

    if(bf(1))
        for(i = 2; i <= N; i++)
            printf("%d ", dist[i]);
    else
        printf("Ciclu negativ!");

    return 0;
}