#include <bits/stdc++.h>

using namespace std;

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

const int N = 1500;

int n, m;

vector <pair <int, int>> g[N + 1];

queue <int> q;

int dist[N + 1], fre[N + 1], cnt[N + 1];

int cycle = 0;

void sega(int x)
{
    q.push(x);
    fre[x] = 1;
    dist[x] = 0;
    while(!q.empty() && cycle == false)
    {
        int nod = q.front();
        q.pop();
        fre[nod] = 0;
        for(int i = 0; i < g[nod].size(); i++)
        {
            int vecin = g[nod][i].first;
            int cost = g[nod][i].second;
            if(dist[nod] + cost < dist[vecin])
            {
                dist[vecin] = dist[nod] + cost;
                cnt[vecin] = cnt[nod] + 1;
                if(cnt[vecin] > n - 1)
                    cycle = true;
                if(!fre[vecin])
                {
                    q.push(vecin);
                    fre[vecin] = 1;
                }
            }
        }
    }
}

int main()
{
    in >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        int l, c, co;
        in >> l >> c >> co;
        g[l].push_back(make_pair(c, co));
    }
    for (int i = 1; i <= n; i++)
    {
        dist[i] = 1e9;
    }
    sega(1);
    if(cycle == true)
        out << "Ciclu negativ!";
    else {
        for(int i = 2; i <= n; i++)
        {
                if (dist[i] == 1e9)
                {
                    out << "x";
                }
                else
                {
                    out << dist[i];
                }
                out << ' ';
        }
    out << '\n';
    }
    return 0;
}