#include <iostream>
#include <fstream>
#include <vector>
#define max 1000000
using namespace std;
ifstream f("bellmanford.in");
ofstream g("bellmanford.out");
int n, m, x, y, cost, dist[50005],ok;
vector<int>src, dest, cst;
void read() {
	f >> n >> m;
	for (int i = 1; i <= m; i++)
	{
		f >> x >> y >> cost;
		src.push_back(x);
		dest.push_back(y);
		cst.push_back(cost);
	}
	for (int i = 1; i <= n; i++)
		dist[i] = max;

}

void solve() {
	for(int i=1;i<=n-1;i++)
		for (int j = 0; j < m; j++)
		{
			
			cost = cst[j];
			int source = src[j];
			int des = dest[j];
			
			if (dist[source] != max and dist[des] > cost + dist[source])
				dist[des] = cost + dist[source];
}
	
	for (int j = 0; j < m; j++)
	{  
		cost = cst[j];
		int source = src[j];
		int des = dest[j];
		if (dist[source] != max and dist[des] > cost + dist[source]) {
			g << "Ciclu negativ!";
			ok = 1;
			break;
			
		}
	}



}
void print() {
	for (int i = 2; i <= n; i++)
		g << dist[i]<<" ";

}
int main() {
	read();
	dist[1] = 0;
	solve();
	if (ok == 0)print();



}