#include<cstdio>
#include<queue>
#include<vector>
using namespace std;
queue <int> Q;
struct Edge
{
	int next,cost;
};
vector <Edge> g[50001];
bool in[50001];
int contor[50001],best[50001];
int main()
{
	freopen("bellmanford.in","r",stdin);
	freopen("bellmanford.out","w",stdout);
	int n,m,i,j,x,y,c,pp=1;
	scanf("%d%d",&n,&m);
	for(i=1;i<=m;i++)
	{
		scanf("%d%d%d",&x,&y,&c);
		Edge o;
		o.next=y;
		o.cost=c;
		g[x].push_back(o);
	}
	Q.push(1);
	best[1]=0;
	in[1]=true;
    while(!Q.empty())
	{
		int node=Q.front();
		in[node]=false;
		Q.pop();
		for(j=0;j<g[node].size();j++)
		{
			if(best[g[node][j].next]>best[node]+g[node][j].cost)
			{
				best[g[node][j].next]=best[node]+g[node][j].next;
				if(in[g[node][j].next]==false&&contor[g[node][j].next]<n)
				{
					Q.push(g[node][j].next);
					contor[g[node][j].next]++;
				}
				if(contor[g[node][j].next]>=n+1)
					pp=0;
			}
		}
	}
	if(pp==0)
		printf("Ciclu Negativ!");
	else
	for(i=2;i<=n;i++)
		printf("%d ",best[i]);
	return 0;
}