#include<iostream>
#include<fstream>
#include<vector>
#include<queue>
using namespace std;
struct muchie{int d,c;};
muchie mm;
long inf=0x3f3f3f3f;
int main()
{ifstream f("bellmanford.in");
ofstream h("bellmanford.out");
vector< vector <muchie> > v(50000);
queue <int> p;
int a,n,m,i,j,xx,ok;
long dd[50000];






f>>n>>m;

for(i=2;i<=n;i++)
	dd[i]=inf;
dd[1]=0;

for(i=1;i<=m;i++)
	{f>>a>>mm.d>>mm.c;
v[a].push_back(mm);}

p.push(1);

do
{ok=0;
	i++;
while(!p.empty())
{xx=p.front();
p.pop();
for(j=0;j<v[xx].size();j++)
if(dd[xx]+v[xx][j].c<dd[v[xx][j].d])
{dd[v[xx][j].d]=dd[xx]+v[xx][j].c;
ok=1;
p.push(v[xx][j].d);}
	
}
	
	
	
	
}while(ok||i==n);

	if(i==n)
		h<<"Ciclu negativ!";
	else
	
	for(i=2;i<=n;i++)
		h<<dd[i]<<" ";
	
	
	
	
	
	
	
	return 0;}