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

ifstream cin("bellmanford.in");
ofstream cout("bellmanford.out");

const int INF = 1e9;

vector<vector<pair<int, int>>> ad;
vector<int> dist;
int n, m;

void bellman_ford() {
    dist[1] = 0;

    // Step 2: Relax all edges (N-1) times
    for (int i = 1; i <= n - 1; i++) {
        for (int u = 1; u <= n; u++) {
            for (auto edge : ad[u]) {
                int v = edge.first;
                int weight = edge.second;
                if (dist[u] != INF && dist[u] + weight < dist[v]) {
                    dist[v] = dist[u] + weight;
                }
            }
        }
    }

    // Step 3: Detect negative weight cycles
    for (int u = 1; u <= n; u++) {
        for (auto edge : ad[u]) {
            int v = edge.first;
            int weight = edge.second;
            if (dist[u] != INF && dist[u] + weight < dist[v]) {
                cout << "Negative cycle detected!\n";
                return;
            }
        }
    }

    // Output shortest paths
    for (int i = 2; i <= n; i++) {
        if (dist[i] == INF) cout << "INF ";
        else cout << dist[i] << " ";
    }
}

int main() {
    cin >> n >> m;
    ad.resize(n + 1);
    dist.assign(n + 1, INF);

    int a, b, c;
    for (int i = 0; i < m; i++) {
        cin >> a >> b >> c;
        ad[a].push_back({ b, c });
    }

    bellman_ford();
    return 0;
}