#include <fstream>
#include <vector>
#include <queue>
#define INF 999999999

using namespace std;

ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");

int n, m, c, x, y, nod, d[50005], pr[50005];
vector <pair<int, int> > v[250005]; //first - vecini; second - cost;
queue <int> q;

bool BellmanFord()
{
    q.push(1);
    for(int i=1; i<=n; i++)
        d[i]=INF;
    d[1]=0;
    while(!q.empty())
    {
        nod=q.front();
        q.pop();
        if(++pr[nod]==n)
            return 0;
        for(int i=0; i<v[nod].size(); i++)
            if(d[v[nod][i].first] > d[nod] + v[nod][i].second)
            {
                q.push(v[nod][i].first);
                d[v[nod][i].first] = d[nod] + v[nod][i].second;
            }
    }
    return 1;
}


int main()
{
    fin >> n >> m;

    for(int i=1; i<=m; i++)
    {
        fin >> x >> y >> c;
        v[x].push_back(make_pair (y, c));
    }

    if(BellmanFord())
        for(int i=1; i<n; i++)
        fout << d[i+1] << ' ';
    else
        fout << "Ciclu negativ!";

    fin.close();
    fout.close();
    return 0;
}