#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream f("bellmanford.in");
ofstream g("bellmanford.out");
#define N_MAX 50005
#define inf 1000000000
int n, m, viz[N_MAX], dist[N_MAX];
vector <pair <int, int> > G[N_MAX];
queue <int> Q;
int bellmanford(int start)
{
    for(int i = 1; i <= n; i++)
        dist[i] = inf;
    dist[start] = 0;
    Q.push(start);
    while(!Q.empty())
    {
        int nod = Q.front();
        Q.pop();
        viz[nod]++;
        if(viz[nod] > n) return 0;
        for(auto it:G[nod])
        {
            if(dist[it.first] > dist[nod] + it.second)
            {
                dist[it.first] = dist[nod] + it.second;
                Q.push(it.first);
            }
        }
    }
    return 1;
}
int main()
{
    f >> n >> m;
    int x, y, z;
    for(int i = 1; i <= m; i++)
    {
        f >> x >> y >> z;
        G[x].push_back({y, z});
    }
    if(bellmanford(1))
    {
        for(int i = 2; i <= n; i++)
            g << dist[i] << " ";
    }
    else g << "Ciclu negativ!";
    return 0;
}