#include<stdio.h>
#include<vector>
#include<queue>
#define inf 2000000000
#define maxn 50003
using namespace std;
FILE*f=fopen("bellmanford.in","r");
FILE*g=fopen("bellmanford.out","w");
int n,m,k,d[maxn],s[maxn],x,y,z,nod;
char viz[maxn];
vector<pair<int,int> > v[maxn];
queue <int> q;
int main()
{
	fscanf(f,"%d%d",&n,&m);
	for(int i=1;i<=m;++i)
	{
		fscanf(f,"%d%d%d",&x,&y,&z);
		v[x].push_back (make_pair(y,z));
	}
	for(int i=2;i<=n;++i)
		d[i]=inf;
	q.push (1);
	viz[1]=1;
	k=1;
	
	while(k&&q.size())
	{
		nod=q.front();
		for(int i=0;i<v[nod].size();++i)
			if(d[v[nod][i].first]>d[nod]+v[nod][i].second)
			{
				if(!viz[v[nod][i].first])
				{
					q.push (v[nod][i].first);
					viz[v[nod][i].first]=1;
				}
				d[v[nod][i].first]=d[nod]+v[nod][i].second;
				s[v[nod][i].first]++;
				if(s[v[nod][i].first]==n)
				{
					k=0;
					break;
				}
			}
		viz[nod]=0;
		q.pop();
		
	}
	
	if(!k)
		fprintf(g,"Ciclu negativ!");
	else
		for(int i=2;i<=n;++i)
			fprintf(g,"%d ",d[i]);
		
	fclose(f);
	fclose(g);
	return 0;
}