#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define NMAX 50002
#define INF 2000
using namespace std;

ifstream in("bellmanford.in");
ofstream out("bellmanford.out");
struct graf
{
    int nod,cost;
}v;
vector<graf> a[NMAX];
queue<int> coada;

int n,m,x,y,d[NMAX],inCoada[NMAX],nod,c,ciclu[NMAX];

bool bellmanford()
{
    coada.push(1);
    inCoada[1] = 1;

    while(!coada.empty())
    {
        nod = coada.front(); coada.pop();
        inCoada[nod] = 0;
        for(int i=0;i<a[nod].size();i++)
        {
          //  cout << nod;
            if(d[nod] + a[nod][i].cost < d[a[nod][i].nod] )
            {

                d[a[nod][i].nod] = d[nod] + a[nod][i].cost;
                if(!inCoada[a[nod][i].nod])
                {
                    inCoada[a[nod][i].nod] = 1;
                    coada.push(a[nod][i].nod);
                    ciclu[a[nod][i].nod]++;
                    if(ciclu[a[nod][i].nod]==n) return false;
                }
            }
        }

    }
    return true;
}

int main()
{
    in >> n >> m;
    for(int i=0;i<m;i++)
    {
        in >> x >> y >> c;
        v.nod = y;
        v.cost = c;
        a[x].push_back(v);
    }
    for(int i=2;i<=n;i++)
    {
        d[i] = INF;
    }
    if(!bellmanford())
    {
        out << "Ciclu negativ!";
    }
    else
    {
        for(int i=2;i<=n;i++)
            out << d[i] << " ";
    }
    return 0;
}