#include <fstream>
#include <vector>
#include <queue>
#define f first
#define s second
#define inf 2000000000
#define nmax 50004
using namespace std;
ifstream f("bellmanford.in");
ofstream g("bellmanford.out");

int n,m,x,y,c,dist[nmax],seen[nmax],ok;
vector <pair<int,int> > G[nmax];
queue <int> q;

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;

    q.push(1);
    while (!q.empty() && ok==0)
    {
        int node=q.front();
        q.pop();
        for (auto ne:G[node])
            if (seen[ne.f]<n && dist[node]+ne.s<dist[ne.f])
            {
                seen[ne.f]++;
                dist[ne.f]=dist[node]+ne.s;
                q.push(ne.f);
            }
            else if (seen[ne.f]>=n) ok=1;
    }

    if (ok==1) g<<"Ciclu negativ!";
    else for (int i=2;i<=n;i++) g<<dist[i]<<' ';

    f.close();
    g.close();
    return 0;
}