#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define NN 50005
#define inf (1<<30)
using namespace std;
ifstream f("bellmanford.in");
ofstream g("bellmanford.out");
int cycle[NN],cost[NN],n,m,a,b,w,x,y,start,finish,weight;
vector< pair<int,int> > vecini[NN];
queue<int> q;

bool BellmanFord()
{
    q.push(1);
    while(!q.empty())
    {
        start=q.front();
        q.pop();
        for(int i=0;i<vecini[start].size();++i)
        {
            finish=vecini[start][i].first;
            weight=vecini[start][i].second;
            if(cost[start]+weight<cost[finish] || cycle[finish]==0)
            {
                cost[finish]=cost[start]+weight;
                cycle[finish]++;
                if(cycle[finish]==n)
                {
                    return true;
                }
                q.push(finish);
            }
        }
    }
    return 0;
}

int main()
{
    f>>n>>m;
    for(int i=1;i<=m;++i)
    {
        f>>a>>b>>w;
        vecini[a].push_back(make_pair(b,w));
    }

    if(BellmanFord())
    {
        g<<"Ciclu negativ!";
    }
    else
    {
        for(int i=2;i<=n;++i)
        {
            g<<cost[i]<<' ';
        }
    }
    return 0;
}