#include <bits/stdc++.h>

using namespace std;

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

#define nmax 50001
const int inf=(1<<30);
int n,m;
int d[nmax],p[nmax],tata[nmax];

struct vecin
{
    int j;
    int c;
};
queue <int>q;

vector <vecin> v[nmax];

void afis_drum(int x)
{
    if(tata[x]==-1)return ;
    afis_drum(tata[x]);
    g<<x<<' ';
}


void afis()
{
    for(int i=1; i<=n; i++)
        if(d[i]!=inf&&d[i]!=0)
        {
            g<<d[i]<<" ";
           /// afis_drum(i);
           /// g<<'\n';
        }
    g<<'\n';
}
void citire()
{
    f>>n>>m;
    for(int i=1; i<=m; ++i)
    {
        vecin w;
        int x;
        f>>x>>w.j>>w.c;
        v[x].push_back(w);
    }
}
bool bellmanford(int sursa)
{
    for(int i=1; i<=n; i++)
        d[i]=inf;
    d[sursa]=0;
    tata[sursa]=-1;
    int k;
    q.push(sursa);
    while(!q.empty())
    {
        k=q.front();
        q.pop();
        p[k]++;
        if(p[k]>n)return 1;
        for(unsigned i=0; i<v[k].size(); i++)
        {
            if(d[v[k][i].j]>d[k]+v[k][i].c)
            {
                d[v[k][i].j]=d[k]+v[k][i].c;
                q.push(v[k][i].j);
                tata[v[k][i].j]=k;
            }
        }

    }
    return 0;
}

int main()
{
    citire();
    ///s reprezinta nodul de unde plecam
    if(bellmanford(1)==0)
    {
        afis();
    }
    else g<<"Ciclu negativ!";
}