#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
#include <cstring>

#define mp make_pair

using namespace std;

const int NodMax = 50005;
const int MuchMax = 250005;
const int inf = 0x3f3f3f3f;

int N, M;
int viz[NodMax], dist[NodMax];
vector < pair < int, int > > G[NodMax]; // vecin si cost
queue < int > Q;

void Read()
{
    scanf("%d %d", &N, &M);
    for(int i=1; i<=M; ++i)
    {
        int x, y, c;
        scanf("%d %d %d", &x, &y, &c);

        G[x].push_back(mp(y,c));
    }

    memset(dist,inf,sizeof(dist));
    dist[1] = 0;
}

void Solve()
{
    Q.push(1);

    bool is_cycle = false;

    while(!Q.empty() && is_cycle == false)
    {
        int nodc = Q.front();
        Q.pop();
        vector < pair < int, int > > ::iterator it;
        for(it=G[nodc].begin(); it!=G[nodc].end(); ++it)
        {
            if(dist[it->first] > dist[nodc] + it->second)
            {
                dist[it->first] = dist[nodc] + it->second;

                ++viz[it->first];

                if(viz[it->first] > N)
                {
                    is_cycle = true;
                    break;
                }

                else
                    Q.push(it->first);
            }
        }
    }

    if(is_cycle == true)
        printf("Ciclu negativ!");

    else
    {
        for(int i=2; i<=N; ++i)
            printf("%d ", dist[i]);
    }
}

int main()
{
    freopen("bellmanford.in", "r", stdin);
    freopen("bellmanford.out", "w", stdout);
    Read();
    Solve();
    return 0;
}