#include <bits/stdc++.h>
#define NMAX 50001
#define INF 1000000500

using namespace std;

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

int n, m;
vector<int> A[NMAX];
vector<int> C[NMAX];
queue<int> Q;
int dmin[NMAX], used[NMAX];

void citire()
{
    int a, b, t;
    fin >> n >> m;
    for(int i = 1; i <= n; ++i) dmin[i] = INF;
    for(int i = 1; i <= m; ++i)
    {
        fin >> a >> b >> t;
        A[a].push_back(b);
        C[a].push_back(t);
    }
}

void bellman_ford(int nod)
{
    int x;
    Q.push(nod);
    dmin[nod] = 0;
    used[nod] = 1;
    while(!Q.empty())
    {
        x = Q.front();
        Q.pop();
        for(int i = 0; i < A[x].size(); i++)
            if(dmin[x] + C[x][i] < dmin[A[x][i]])
            {
                dmin[A[x][i]] = dmin[x] + C[x][i];
                Q.push(A[x][i]);
                used[A[x][i]]++;
                if(used[A[x][i]] == n)
                {
                    fout << "Ciclu negativ!" << '\n';
                    exit(0);
                }
            }
    }
}

void afisare()
{
    for(int i = 2; i <= n; ++i)
        fout << dmin[i] << ' ';
}

int main()
{
    citire();
    bellman_ford(1);
    afisare();
    return 0;
}