#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define lim 50001
#define inf 50000000
#define f first
#define s second
using namespace std;
ifstream f("bellmanford.in");
ofstream g("bellmanford.out");
int n,m,x,y,c,dist[lim],pred[lim],viz[lim];
vector <pair <int,int> > G[lim];
queue <int> q;
bool ok=false, inq[lim];
int main()
{
    f>>n>>m;
    for (int i=1;i<=m;i++)
    {
        f>>x>>y>>c;
        G[x].push_back({y,c});
    }
    for (int i=2;i<=n;i++) dist[i]=inf;
    dist[1]=0;
    q.push(1);
    inq[1]=1;
    while (!q.empty())
    {
        int nod=q.front();
        q.pop();
        viz[nod]++;
        inq[nod]=0;
        if (viz[nod]==n)
        {
            ok=true;
            break;
        }
        for (auto vec:G[nod])
        {
            if (dist[nod]+vec.s<dist[vec.f])
            {
                dist[vec.f]=dist[nod]+vec.s;
                if (!inq[vec.f])
                {
                    q.push(vec.f);
                    inq[vec.f]=1;
                }
            }
        }
    }
    if (ok==true) g<<"Ciclu negativ!";
    else for (int i=2;i<=n;i++) g<<dist[i]<<" ";
    f.close();
    g.close();
    return 0;
}