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

using namespace std;

#define inf 2e9
#define MaxSize 50005

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

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 });
    }

    for (int i = 2; i <= n; i++)
    {
        md[i] = inf;
    }
    md[1] = 0;

    queue<int> q;
    q.push(1);

    // Seamana cu dijkstra, dar diferenta majora e ca aici pot verifica un nod de cate ori vreau eu,
    // fara sa fiu oprit de conditia de verificare
    while (!q.empty())
    {
        int nod = q.front();
        q.pop();
        viz[nod]++;

        if (viz[nod] == n)
        {
            fout << "Ciclu negativ!";
            fout.close();
            fin.close();
            return 0;
        }

        for (pair<int, int> i : G[nod])
        {
            if (i.second + md[nod] < md[i.first])
            {
                md[i.first] = i.second + md[nod];
                q.push(i.first);
            }
        }
    }
    
    for (int i = 2; i <= n; i++)
    {
        fout << md[i] << " ";
    }

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

    return 0;
}