#include <fstream>
#include <vector>
#include <queue>

#define pb push_back

using namespace std;
ifstream in("bellmanford.in");
ofstream out("bellmanford.out");
const int inf = 2e9;

int n, m, fr[50005], ans[50005];
vector<pair<int, int>> v[50005];
queue<int> que;
bool is[50005];

int main()
{
    in >> n >> m;
    for(int i=1; i<=m; i++) {
        int x, y, c;
        in >> x >> y >> c;
        v[x].pb({y, c});
    }

    for(int i=2; i<=n; i++)
        ans[i] = inf;

    que.push(1);
    is[1] = 1;
    while(!que.empty()) {
        int nod = que.front();
        que.pop();

        is[nod] = 0;

        for(int i=0; i<v[nod].size(); i++) {
            int nxt = v[nod][i].first;
            int nxtcost = v[nod][i].second + ans[nod];
            if(is[nxt])
                continue;

            if(nxtcost < ans[nxt]) {
                fr[nxt]++;
                if(fr[nxt] == n) {
                    out << "Ciclu negativ!";
                    return 0;
                }

                que.push(nxt);
                ans[nxt] = nxtcost;
                is[nxt] = 1;
            }
        }
    }

    for(int i=2; i<=n; i++)
        out << ans[i] << ' ';
    return 0;
}