#include <fstream>
#include <vector>
#include <queue>
#define Nmax 50005
#define INF 1000000005

using namespace std;

ifstream f("bellmanford.in");
ofstream g("bellmanford.out");

queue <int> Q;
vector <int> lc[Nmax], ls[Nmax];

int n, m;
int x, y, c;
int d[Nmax], cnt[Nmax];

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