#include <cstdio>
#include <vector>
#include <queue>
#include <climits>
#define SIZE 50001
#define inf INT_MAX
using namespace std;
struct graph{
    int node, cost;
} a;
vector <graph> v[SIZE];
queue <int> c;
int n, m, i, x, y, z, d[SIZE], used[SIZE];
bool sw;
int main()
{
    freopen("bellmanford.in", "r", stdin);
    freopen("bellmanford.out", "w", stdout);
    scanf("%d %d", &n, &m);
    for(i=2;i<=n;++i)
        d[i]=inf;
    for(i=1;i<=m;++i)
    {
        scanf("%d %d %d", &x, &y, &z);
        a.node=y;
        a.cost=z;
        v[x].push_back(a);
    }
    c.push(1);
    while(!c.empty()&&!sw)
    {
        x=c.front(); c.pop();
        for(i=0;i<v[x].size();++i)
            if(d[v[x][i].node]>v[x][i].cost+d[x])
            {
                d[v[x][i].node]=v[x][i].cost+d[x];
                used[v[x][i].node]++;
                if(used[v[x][i].node]==n)
                    sw=1;
                c.push(v[x][i].node);
            }
    }
    if(!sw)
    {
        for(i=2;i<=n;++i)
            printf("%d ", d[i]);
        printf("\n");
    }
    else
        printf("Ciclu negativ!\n");
    return 0;
}