#include<bits/stdc++.h>
using namespace std;
ifstream f("bellmanford.in");
ofstream g("bellmanford.out");
const int NMAX=50005,INF=0x3F3F3F3F;
int n,m,x,y,c;
vector<pair<int,int>>v[NMAX];
vector<int>a;
bool spfa(int start,vector<int>& d)
{
    d.assign(n+1,INF);
    vector<int>cnt(n,0);
    queue<int>q;
    bitset<NMAX>inqueue;
    d[start]=0;
    q.push(start);
    inqueue[start]=1;
    while(!q.empty())
    {
        int now=q.front();
        q.pop();
        inqueue[now]=0;
        for(auto edge : v[now])
        {
            int to=edge.first,len=edge.second;///destinatia+costul
            if(d[now]+len<d[to])
            {
                d[to]=d[now]+len;
                if(!inqueue[to])
                {
                    q.push(to);
                    inqueue[to]=1;
                    cnt[to]++;
                    if(cnt[to]>n)
                        return 0;///ciclu negativ
                }
            }
        }
    }
    return 1;
}
int main()
{
    f>>n>>m;
    for(int i=1; i<=n; i++)
    {
        f>>x>>y>>c;
        v[x].push_back({y,c});
    }
    bool ans=spfa(1,a);
    if(ans==0)
        g<<"Ciclu negativ!";
    else
        for(int i=2; i<a.size(); i++)
            g<<a[i]<<" ";
    return 0;
}