#include <fstream>
#include <vector>
#include <queue>
using namespace std;
#define INF 0x3f3f3f3f
#define MAXN 50001
ifstream cin("bellmanford.in");
ofstream cout("bellmanford.out");

struct rct
{
    int nod,cost;
}aux;
vector<rct> graf[MAXN];
queue<int> coada;
int i,n,m,x,y,c,nod;
int dist[MAXN],nrc[MAXN];
bool negativ;

int main()
{
    cin>>n>>m;
    for(i=1; i<=m; i++)
    {
        cin>>x>>aux.nod>>aux.cost;
        graf[x].push_back(aux);
    }

    for(i=1; i<=n; i++)
        dist[i]=INF;

    dist[1]=0;
    coada.push(1);
    while(!coada.empty())
    {
        nod = coada.front(); coada.pop();
        for(i=0; i<graf[nod].size(); i++)
        {
            if(dist[graf[nod][i].nod] > dist[nod] + graf[nod][i].cost)
            {
                if(nrc[graf[nod][i].nod] > n)
                    negativ=true;
                else
                {
                    dist[graf[nod][i].nod] = dist[nod] + graf[nod][i].cost;
                    nrc[graf[nod][i].nod]++;
                    coada.push(graf[nod][i].nod);
                }
            }
        }
    }
    if(negativ)
        cout<<"Ciclu negativ!";
    else
        for(i=2; i<=n; i++)
            cout<<dist[i]<<" ";
}