#include <cstdio>
#include <vector>
using namespace std;

#define INF 0x3f3f3f3f
#define MAX 50005

typedef vector<pair<int,int> >::iterator iter;
vector<pair<int,int> > g[MAX];
int n,m,cn=0,d[MAX],p[MAX];

inline bool bellmanford(){
	for(int i=2;i<=n;i++){
		d[i]=INF,p[i]=0;
	}
	for(int i=1;i<=n;i++){
		for(iter it=g[i].begin();it!=g[i].end();it++){
			if(d[i]+it->second<d[it->first]){
				d[it->first]=d[i]+it->second;
				p[it->first]=i;
			}	
		}
	}
	
	for(int i=0;i<=n;i++){
		for(iter it=g[i].begin();it!=g[i].end();it++){
			if(d[i]+it->second<d[it->first]){
				return false;
			}
		}
	}
	return true;
}

int main(){
	int x,y,c;
	FILE* fin=fopen("bellmanford.in","r");
	FILE* fout=fopen("bellmanford.out","w");

	fscanf(fin,"%d %d\n",&n,&m);

	for(int i=0;i<m;i++){
		fscanf(fin,"%d %d %d\n",&x,&y,&c);
		g[x].push_back(make_pair(y,c));
	}

	if(!bellmanford()){
		fprintf(fout,"Ciclu negativ!\n");
	}else{
		for(int i=2;i<=n;i++){
			fprintf(fout,"%d ",(d[i]==INF)?0:d[i]);
		}
	}

	fclose(fin);
	fclose(fout);
	return 0;
}