#include <fstream>
#include <queue>
#include <vector>
#define inf 10000000000
using namespace std;
ifstream f("bellmanford.in");
ofstream g("bellmanford.out");
priority_queue<pair<int,int>,vector<pair<int,int> >, greater<pair<int,int> > >h;
vector<pair<int,int> >v[250005];
long long d[50005];
int viz[50005];
int main()
{
    int n,m,i,j,x,y,c;
    f>>n>>m;
    for(i=1; i<=m; i++)
    {
        f>>x>>y>>c;
        v[x].push_back({c,y});
    }
    for(i=2; i<=n; i++)
    {
        d[i]=inf;
    }
    h.push({0,1});
    while(!h.empty())
    {
        int nod=h.top().second;
        h.pop();
        for(i=0; i<v[nod].size(); ++i)
        {
            if(d[nod]+v[nod][i].first<d[v[nod][i].second])
            {
                d[v[nod][i].second]=d[nod]+v[nod][i].first;
                h.push({d[v[nod][i].second],v[nod][i].second});
            }
        }
        viz[nod]++;
        if(viz[nod]==n)
        {
            g<<"Ciclu negativ!";
            return 0;
        }
    }
    for(i=2; i<=n; i++)
    {
        if(d[i]!=inf) g<<d[i]<<" ";
        else g<<0<<" ";
    }
    return 0;
}