#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
#include <utility>
#define NMAX 50005
#define INF 60000000
using namespace std;

vector< pair<int,int> > a[NMAX];
int n,m,d[NMAX],ciclu[NMAX],nod,x,y,c;
queue<int> coada;
bool inCoada[NMAX];

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

int main()
{
    in >> n >> m;
    for(int i=0;i<m;i++) {
        in >>x >> y >> c;
        a[x].push_back(make_pair(y,c));
    }

    for(int i=2;i<=n;i++) {
        d[i] = INF;
    }
    inCoada[1] = true;
    coada.push(1);

    while(!coada.empty()) {
        nod = coada.front();
        coada.pop();
        inCoada[nod] = false;
        for(int i=0;i<a[nod].size();i++) {

            if(d[a[nod][i].first]>d[nod] + a[nod][i].second) {
                d[a[nod][i].first] = d[nod] + a[nod][i].second;

                if(!inCoada[a[nod][i].first]) {
                    inCoada[a[nod][i].first] = true;
                    coada.push(a[nod][i].first);
                    ciclu[a[nod][i].first]++;

                    if(ciclu[a[nod][i].first]==n+1) {
                        out << "Ciclu negativ!";
                        return 0;
                    }
                }
            }
        }
    }

    for(int i=2;i<=n;i++) {
        out << d[i] << " ";
    }
    return 0;
}