#include <fstream>
#include <vector>
#include <queue>
#include <cstring> // memset
#define INF 0x3f3f3f3f

using namespace std;
using PA = pair<int, int>;

ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");

int n, m, k, c[50005], v[50005];
vector<PA> G[50005];
queue<int> Q;

bool bellmanford(int nod) {
    memset(c, INF, sizeof(c));
    c[nod] = 0;
    Q.push(nod);
    while(!Q.empty()) {
        nod = Q.front();
        v[nod]++;
        if(v[nod] >= n) { // ciclu negativ
            return false;
        }
        Q.pop();
        for(auto i : G[nod]) {
            int vecin = i.first, cost = i.second;
            if(c[vecin] > c[nod] + cost) {
                c[vecin] = c[nod] + cost;
                Q.push(vecin);
            }
        }
    }
    return true;
}

int main() {
    fin >> n >> m;
    for(int i = 1; i <= m; i++) {
        int x, y, c;
        fin >> x >> y >> c;
        G[x].push_back({y, c});
    }
    if(bellmanford(1)) {
        for(int i = 2; i <= n; i++) {
            fout << c[i] << " ";
        }
    } else {
        fout << "Ciclu negativ!";
    }
    return 0;
}