#include <fstream>
#include <vector>
#include <queue>
#define NMAX 1003
#define INF 1000000000

using namespace std;

ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");

struct varf
{
    int x, c;
};

vector <varf> G[NMAX];
int n, x0=1, rez;
int c[NMAX][NMAX];
int d[NMAX];
int cmin[NMAX];
int pre[NMAX];
int afis[NMAX];
bool uz[NMAX];
int nr[NMAX];
queue <int> C;

void citire();
void afisare();
bool bellmanford();

int main()
{
    citire();
    rez=bellmanford();
    afisare();
    return 0;
}

void citire()
{
    int i, j, c, m;
    varf aux;
    fin>>n>>m;
    while (fin>>i>>j>>c)
    {
        aux.x=j;
        aux.c=c;
        G[i].push_back(aux);
    }
    for (i=1; i<=n; i++)
        cmin[i]=INF;
    cmin[x0]=0;
    nr[x0]=1;
}

bool bellmanford()
{
    int x, vf, cost, i;
    ///initializez coada cu varful de start
    C.push(x0);
    nr[x0]=1;
    while (!C.empty())
    {
        x=C.front();
        C.pop();
        ///parcurg lista de adiacenta a lui x
        for (i=0; i<G[x].size(); i++)
        {
            vf=G[x][i].x;
            cost=G[x][i].c;
            if (cmin[vf]>cmin[x]+cost)
            {
                cmin[vf]=cmin[x]+cost;
                C.push(vf);
                nr[vf]++;
                if (nr[vf]==n)
                    return 0;
            }
        }
    }
    return 1;
}

void afisare()
{
    int i;
    if (rez==0)
        fout<<"ciclu negativ";
    else
        for (i=2; i<=n; i++)
        fout<<cmin[i]<<' ';
        fout<<'\n';
}