#include <iostream>
#include <fstream>
#include <iomanip>
#include <cmath>
#include <vector>
#include <queue>
#define INF (1<<28)
#define Nmax 50005

using namespace std;

string file="bellmanford";

ifstream f( (file + ".in").c_str() );
ofstream g( (file + ".out").c_str() );


int n, m;
vector <pair <int, int> > v[Nmax];
queue <int> Q;
int cnt[Nmax], d[Nmax];

int main()
{
    f >> n >> m;
    for (int i = 1, x, y, c; i <= m; i++)
    {
        f >> x >> y >> c;
        v[x].push_back({y, c});
        //v[y].push_back({x, c});
    }
    for (int i = 1; i <= n; i++) d[i]=INF;
    d[1]=0;
    Q.push(1);
    while(!Q.empty())
    {
        int x=Q.front();
        Q.pop();
        for (int i = 0, l=v[x].size(); i < l; i++)
        {
            int y=v[x][i].first;
            int c=v[x][i].second;
            if(d[y]>d[x]+c)
            {
                d[y]=d[x]+c;
                cnt[y]++;
                Q.push(y);
            }
            if(cnt[y] == n-1)
            {
                g << "Ciclu negativ!";
                return 0;
            }
        }
    }
    for (int i = 2; i <= n; i++) g << d[i] << " ";

    return 0;
}