#define INF 0x3f3f3f3f
#define MAX_N 50000

#include <fstream>
#include <vector>
#include <queue>
#include <tuple>
using namespace std;

ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");

using TII = tuple<int, int>;

int n, m, D[MAX_N + 1], Ap[MAX_N + 1];
queue<int> Q;
vector<TII> G[MAX_N + 1];
bool cn;

int main()
{
	fin >> n >> m;
	for (int i = 0, x, y, c; i < m; ++i)
	{
		fin >> x >> y >> c;
		G[x].emplace_back(y, c);
	}
	
	for (int i = 2; i <= n; ++i)
	{
		D[i] = INF;
	}
	D[1] = 0;
	Q.push(1);
	
	while (!Q.empty())
	{
		int nod = Q.front();
		Q.pop();
		
		if ((++Ap[nod]) > n)
		{
			cn = true;
			break;
		}
		
		for (const auto& vecin : G[nod])
		{
			if (D[get<0>(vecin)] > (D[nod] + get<1>(vecin)))
			{
				D[get<0>(vecin)] = D[nod] + get<1>(vecin);
				Q.push(get<0>(vecin));
			}
		}
	}
	
	if (cn)
	{
		fout << "Ciclu negativ!";
	}
	else
	{
		for (int i = 2; i <= n; ++i)
		{
			fout << D[i] << ' ';
		}
	}
	
	fin.close();
	fout.close();
	return 0;
}