#include <iostream>
#include <fstream>
#include <stack>
#include <vector>
#include <deque>
#include <ctime>
#include <queue>

#define ll long long
#define ull unsigned long long
#define pb push_back
using zint = int;
using namespace std;
const int inf = 1e9 + 5;
const int NMax = 5e4 + 5;
ifstream in("bellmanford.in");
ofstream out("bellmanford.out");

int N,M;
bool inQueue[NMax];
int nrInQueue[NMax],dist[NMax];

struct elem {
    int y,c;
    elem(int _y = 0,int _c = 0) {
        y = _y;
        c = _c;
    }
};
vector<elem> v[NMax];

int main() {
    in>>N>>M;
    for (int i=1;i <= M;++i) {
        int x,y,c;
        in>>x>>y>>c;

        v[x].push_back(elem(y,c));
    }

    for (int i=1;i <= N;++i) {
        dist[i] = inf;
    }
    dist[1] = 0;
    queue<elem> Q;
    Q.push(elem(1,0));
    bool neg = false;
    while (Q.size()) {
        elem e = Q.front();
        Q.pop();

        if (dist[e.y] < e.c) {
            continue;
        }
        inQueue[e.y] = false;
        ++nrInQueue[e.y];
        if (nrInQueue[e.y] == N) {
            neg = true;
            break;
        }

        for (auto el : v[e.y]) {
            int nxt = el.y, cost = el.c;
            if (dist[nxt] > dist[e.y] + cost) {
                dist[nxt] = dist[e.y] + cost;

                if (!inQueue[nxt]) {
                    Q.push(elem(nxt,dist[nxt]));
                }
            }
        }
    }

    if (neg) {
        out<<"Ciclu negativ!";
    }
    else {
        for (int i=2;i <= N;++i) {
            out<<dist[i]<<' ';
        }
    }

    in.close();out.close();
    return 0;
}