#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>

using namespace std;

#define inf 500000

int n, m;
vector<pair<int, int>> G[50005];
int md[50005];


int main()
{
    ifstream fin("bellmanford.in");
    ofstream fout("bellmanford.out");
    fin >> n >> m;
    int x, y, c;
    for (int i = 0; i < m ; i++)
    {
        fin >> x >> y >> c;
        G[x].push_back({ y, c });
    }

    memset(md, inf, sizeof(md));
    md[1] = 0;

    for (int k = 0; k < n - 1; k++)
    {
        for (int i = 1; i <= n; i++)
        {
            if (i == inf)
                continue;
            for (pair<int,int> j : G[i])
            {
                if (j.second + md[i] < md[j.first])
                    md[j.first] = md[i] + j.second;
            }
        }
    }

    bool ciclu = false;
    for (int i = 1; i <= n; i++)
    {
        if (i == inf)
            continue;
        for (pair<int, int> j : G[i])
        {
            if (j.second + md[i] < md[j.first])
                ciclu = true;
        }
        if (ciclu)
            break;
    }

    if (ciclu)
    {
        fout << "Ciclu negativ!" << std::endl;
    }
    else
    {
        for (int i = 2; i <= n; i++)
        {
            fout << md[i] << " ";
        }
    }

    fin.close();
    fout.close();
}