//solves single-source shortest path in O(VE)
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#define ii pair<int, int>
#define ff first
#define ss second
using namespace std;
const int MX = 1e5+1, INF = 1e9;
int n, m, dist[MX];
vector<vector<ii> > adj(MX);

int main() {
	freopen ("bellmanford.in", "r", stdin);
	freopen ("bellmanford.out", "w", stdout);
	cin >> n >> m;
	int u, v, c;
	for (int i = 0; i < m; i++) {
		cin >> u >> v >> c;
		adj[u].push_back(ii(v, c));
	}
	for (int i = 0; i < MX; i++) {
		dist[i] = INF;
	}
	dist[1] = 0;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			for (int k = 0; k < adj[j].size(); k++) {
				ii v = adj[j][k];
				dist[v.ff] = min(dist[v.ff], dist[j] + v.ss);
			}
		}
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 0; j < adj[i].size(); j++) {
			ii v = adj[i][j];
			if (dist[v.ff] > dist[i] + v.ss) {
				cout << "Ciclu negativ!";
				return 0;
			}
		}
	}
	for (int i = 2; i <= n; i++) {
		cout << dist[i] << " ";
	}
	return 0;
}