#include <fstream>
#include <vector>
#include <queue>
#include <bitset>
#include <limits.h>
using namespace std;
ifstream in("bellmanford.in");
ofstream out("bellmanford.out");
#define N 50001
int n,m,i,x,y,c,vecin,cost,d[N],viz[N];
vector < pair<int,int> > G[N];
queue <int> Q;
bitset <N> in_queue;
int bellman()
{
    Q.push(1);
    d[1]=0;
    in_queue[1]=1;
    while (!Q.empty())
    {
        int x=Q.front();
        viz[x]++;
        if (viz[x]==n)
            return 1;
        for (int i=0; i<G[x].size(); ++i)
        {
            vecin=G[x][i].first;
            cost=G[x][i].second;
            if (d[x]+cost<d[vecin])
            {
                d[vecin]=cost+d[x];
                if (!in_queue[vecin])
                {
                    in_queue[vecin]=1;
                    Q.push(vecin);
                }
            }
        }
        in_queue[x]=0;
        Q.pop();
    }
    return 0;
}
int main()
{
    in>>n>>m;
    for (i=1; i<=m; ++i)
    {
        in>>x>>y>>c;
        G[x].push_back(make_pair(y,c));
    }
    for (i=1;i<=n;++i)
         d[i]=INT_MAX;
    if (bellman())
        out<<"Ciclu negativ!";
    else
    {
        for (i=2; i<=n; ++i)
            out<<d[i]<<" ";
        out<<"\n";
    }
}