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

#define INF 0x3f3f3f3f
#define MAXN 50005
#define MAXM 250005

struct edge{
	int x,y,c;
};

typedef vector<int>::iterator iter;
edge edg[MAXM];

int n,m,cn=0,d[MAXN];

inline bool bellmanford(){
	for(int i=2;i<=n;i++){
		d[i]=INF;
	}

	d[1]=0;

	for(int i=1;i<=n;i++){
		for(int j=0;j<m;j++){
			if(d[edg[j].x]+edg[j].c<d[edg[j].y]){
				d[edg[j].y]=d[edg[j].x]+edg[j].c;
			}
		}
	}

	for(int i=0;i<m;i++){
		if(d[edg[i].x]+edg[i].c<d[edg[i].y]){
			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);
		edg[i].x=x,edg[i].y=y,edg[i].c=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;
}