#include <iostream>
#include <fstream>
#include <cmath>
#include <vector>
#include <queue>

using namespace std;
ifstream in("bellmanford.in");
ofstream out("bellmanford.out");

const int NMax = 5e4 + 5;
const int inf = 2e9 + 5;
typedef long long ll;

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

struct elem {
    int y,c;
    elem() {}
    elem(int a,int b) {
        y = a;
        c = b;
    }
};
vector<elem> v[NMax];

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

        elem n(b,c);
        v[a].push_back(n);
    }

    for (int i=2;i<=N;++i) {
        dist[i] = inf;
    }
    dist[1] = 0;

    queue<int> Q;
    Q.push(1);
    bool neg = false;
    while (Q.size()) {
        int nod = Q.front();
        Q.pop();

        inQueue[nod] = false;
        ++nr[nod];
        if (nr[nod] == N) {
            neg = true;
            break;
        }

        for (int k=0; k < (int)v[nod].size(); ++k) {
            int next = v[nod][k].y, cost = v[nod][k].c;
            if (dist[next] > dist[nod] + cost) {
                dist[next] = dist[nod] + cost;

                if (!inQueue[next]) {
                    inQueue[next] = true;

                    Q.push(next);
                }
            }
        }
    }

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

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