#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;

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

vector <pair <int, int>> v[50001];
int d[50001], opt[50001];

queue <int> q;
bool okq[50001];

bool bellman (int n)
{
    int i, na, nv;

    for (i = 1; i<=n; i++)
        d[i] = 1<<30;
    d[1] = 0;
    okq[1] = 1;
    q.push (1);

    while (q.empty() == 0)
    {
        na = q.front();
        q.pop();
        okq[na] = 0;

        for (i = 0; i<v[na].size(); i++)
        {
            nv = v[na][i].first;
            if (d[nv] > d[na] + v[na][i].second)
            {
                d[nv] = d[na] + v[na][i].second;
                if (okq[nv] == 0)
                {
                    q.push (nv);
                    okq[nv] = 1;
                    opt[nv]++;

                    if (opt[nv] == n)
                        return 0;
                }
            }
        }
    }
    return 1;
}

int main()
{
    int n, m, i, x, y, z;
    fin >> n >> m;
    for (i = 1; i<=m; i++)
    {
        fin >> x >> y >> z;
        v[x].push_back ({y, z});
    }

    if (bellman (n) == 0)
        fout << "Ciclu negativ!";
    else
        for (i = 2; i<=n; i++)
            fout << d[i] << ' ';
    return 0;
}