#include <fstream>
#include <vector>
#include <bitset>
#include <queue>
#define DIM 50011
#define INF 1000111
using namespace std;
ifstream f("bellmanford.in");
ofstream g("bellmanford.out");
int n,m;
int D[DIM],U[DIM];

vector<pair<int,int> > L[DIM];
bitset<DIM> viz;
queue<int> q;

int main(void){
    register int i,j,x,y,c,nod,ng=0;
    vector<pair<int,int> >::iterator it;

    f>>n>>m;
    for(i=1;i<=m;i++){
        f>>x>>y>>c;
        L[x].push_back(make_pair(c,y));
    }
    for(i=2;i<=n;i++) D[i]=INF;

    q.push(1);
    while(!q.empty() && !ng){
        nod=q.front(),q.pop(),viz[nod]=0;
        for(it=L[nod].begin();it!=L[nod].end();it++){
            if(D[it->second]>D[nod]+it->first){
                U[it->second]++;
                if(U[it->second]==n){
                    ng=1;
                    break;
                }
                D[it->second]=D[nod]+it->first;
                if(!viz[it->second]){
                    q.push(it->second),viz[it->second]=1;
                }
            }
        }
    }

    if(ng){
        g<<"Ciclu negativ!";
        f.close();
        g.close();
        return 0;
    }
    for(i=2;i<=n;i++){
        if(D[i]==INF) D[i]=0;
        g<<D[i]<<" ";
    }
    f.close();
    g.close();
    return 0;
}