#include <fstream>
#include <vector>
#include <queue>

#define NMAX 50003
#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;
int c[NMAX][NMAX];
int d[NMAX];
int cmin[NMAX];
int pre[NMAX];
bool uz[NMAX];
int afis[NMAX];
int nr[NMAX];

queue <int> C;

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


int main()
{
    citire();
    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;
}

bool bellmanford()
///returneaza 0 daca exista circ de cost negativ si 1 altfel
{
    int x, vf, cost, i;
    ///initializez coada cu vf 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 rez, i;
    if (rez == 0)
        fout<<"Ciclu negativ";
        else
            for (i=2; i<=n; i++)
    fout<<'\n';
}