#include <iostream>
#include <vector>
#include <queue>
#include <fstream>
#define NMAX 50005
#define inf 2000000000
using namespace std;
ifstream f("bellmanford.in");
ofstream g("bellmanford.out");
vector <pair<int,int>> v[NMAX];
queue <int>q ;
int d[NMAX],used[NMAX],n,m,i,x,y,c;
bool exista;
void BFS()
{
    q.push(1);
    while(!q.empty())
    {
        int curr=q.front();
        q.pop();
        for(auto & it: v[curr])
        {
            if(d[it.first]> d[curr]+it.second)
            {
                if(used[it.first]==n)
                {
                    exista=1;
                    return;
                }
                else
                {
                    d[it.first]=d[curr]+it.second;
                    q.push(it.first);
                    used[it.first]++;
                }
            }
        }
    }
}
int main()
{
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>x>>y>>c;
        v[x].push_back({y,c});
    }
    for(i=2;i<=n;i++) d[i]=inf;
    BFS();
    if(exista)
    {
        g<<"Ciclu negativ!"<<"\n";
        return 0;
    }
    else
    {
        for(i=2;i<=n;i++)
        {
            if(d[i]==inf) g<<0<<" ";
            else g<<d[i]<<" ";
        }
    }
    return 0;
}