#include <bits/stdc++.h>

using namespace std;

#if 1
    #define pv(x) std::cerr<<#x<<" = "<<(x)<<"; ";std::cerr.flush()
    #define pn std::cerr<<std::endl
#else
    #define pv(x)
    #define pn
#endif

#ifdef INFOARENA
    ifstream in("dijkstra.in");
    ofstream out("dijkstra.out");
#else
    #define in cin
    #define out cout
#endif

using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
using ld = long double;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pld = pair<ld, ld>;
#define pb push_back
const double PI = 3.14159265358979323846264338327950288419716939937510582097494459230781640628620899862;
const int inf_int = 1e9 + 5;
const ll inf_ll = 1e18 + 5;
const int NMax = 1e5 + 5;
const int dx[] = {-1,0,0,+1}, dy[] = {0,-1,+1,0};
const double EPS = 1e-8;

int dist[NMax];

struct elem {
    int x,y,c;
}edge[NMax];

int main() {
    cin.sync_with_stdio(false);
    cin.tie(0);

    int N,M;
    in >> N >> M;
    for (int i = 1; i <= M; ++i) {
        in >> edge[i].x >> edge[i].y >> edge[i].c;        
    }

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

    bool update = false;
    for (int i = 1; i <= N; ++i) {
        update = false;
        for (int j = 1; j <= M; ++j) {
            int x = edge[j].x, y = edge[j].y, cost = edge[j].c;
            if (dist[y] > dist[x] + cost) {
                dist[y] = dist[x] + cost;
                update = true;
            }
        }
    }

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

    return 0;
}