#include <iostream>
#include <queue>
#include <fstream>
#include <vector>
#define INF 1010
using namespace std;

int n, m;
vector < pair <int, int> > G[50002];
int nr[50002], dmin[50002];
bool negativ;
queue <int> q;

void read()
{
     ifstream f("bellmanford.in");
     f >> n >> m;
     for(int i=0, x, y, c; i<m; ++i)
     {
         f >> x >> y >> c;
         G[x].push_back(make_pair(y,c));
     }
     f.close();
}

void bellman_ford()
{
    vector < pair <int, int> > :: iterator it;
    int i,x;
    for(i=1; i<=n; ++i)
        dmin[i]=INF;
    dmin[1]=0;
    q.push(1);
    while(!q.empty() && !negativ)
    {
        x=q.front(); q.pop();
        for(it=G[x].begin(); it!=G[x].end(); ++it)
        {
            if(dmin[it->first] > dmin[x] + it->second)
            {
                dmin[it->first]=dmin[x] + it->second;
                nr[it->first]++;
                q.push(it->first);
                if(nr[it->first]>n)
                    negativ=true;
            }
        }
    }
}

void out()
{
    ofstream g("bellmanford.out");
    if(negativ)
    g << "Ciclu negativ!" << '\n';
    else
    {
        for(int i=2; i<=n; ++i)
        {
            g << dmin[i]<< ' ';
        }
        g << '\n';
    }

    g.close();
}

int main()
{
    read();
    bellman_ford();
    out();
    return 0;
}