#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#define N 50000
#define M 250000
#define INF 1e8

typedef struct
{
    int e, urm;
} element;

typedef struct
{
    int x, y, c;
} muchie;

int lst[N+1], n, m, nr, d[N+1];
element v[M+1];
muchie e[M+1];

void adauga(int x, int i_e)
{//adauga pe y in lista de adiacenta a lui x
    v[++nr].e = i_e;
    v[nr].urm = lst[x];
    lst[x] = nr;
}

void initializeaza(int x0)
{
    for (int i = 1; i <= n; i++)
    {
        d[i] = INF;
    }
    d[x0] = 0;
}

bool actualizeaza()
{
    bool actual = false;
    for (int i = 1; i <= m; i++)
    {
        int x = e[i].x, y = e[i].y, c = e[i].c;
        if (d[x] + c < d[y])
        {
            d[y] = d[x] + c;
            actual = true;
        }
    }
    return actual;
}

bool bellmanford(int x0)
{
    initializeaza(x0);
    int nr_it = 0;
    bool actual;
    do
    {
        actual = actualizeaza();
        nr_it++;
    }
    while (actual && nr_it < n);
    return (!actual);
}

int main()
{
    FILE *in, *out;
    in = fopen("bellmanford.in", "r");
    out = fopen("bellmanford.out", "w");
    fscanf(in, "%d%d", &n, &m);
    for (int i = 1; i <= m; i++)
    {
        fscanf(in, "%d%d%d", &e[i].x, &e[i].y, &e[i].c);
        adauga(e[i].x, i);
    }
    fclose(in);
    if (!bellmanford(1))
    {
        fprintf(out, "Ciclu negativ!");
    }
    else
    {
        for (int i = 2; i <= n; i++)
        {
            fprintf(out, "%d ", d[i]);
        }
    }
    fclose(out);
    return 0;
}