#include <iostream>
#include <cstdio>
#include <queue>
#include <vector>
#include <bitset>
#define N 50005
#define inf 0x3f3f3f3f

using namespace std;

int n,m,d[N],nr_aparitii[N];

vector <pair <int,int> > G[N];

queue <int> q;

bitset <N> viz;

int prelucrare()
{
    q.push(1);

    d[1]=0;

    vector <pair <int,int> >::iterator it;

    while(!q.empty())
    {
        int tmp=q.front();
        q.pop();

        viz[tmp] = false;

        for(it = G[tmp].begin(); it != G[tmp].end(); ++it)
        {
            int x = it->first + d[tmp];
            if(x < d[it->second])
            {
                d[it->second] = x;

                if(nr_aparitii[it->second] > n)
                {
                    return 0;
                }
                else
                {
                    q.push(it->second);
                    nr_aparitii[it->second] ++;
                }
            }
        }
    }
    return 1;
}

void citire()
{
    scanf("%d %d\n",&n,&m);

    for(int i = 0; i < m; ++i)
    {
        int a,b,c;
        scanf("%d %d %d\n",&a,&b,&c);

        G[a].push_back(make_pair(c,b));
    }

    for(int i = 2; i <= n; ++i)
    {
        d[i] = inf;
    }

    if(prelucrare())
    {
        for(int i = 2; i <= n; ++i)
        {
            printf("%d ",d[i]);
        }
    }
    else
    {
        printf("Ciclu negativ!");
    }

}

int main()
{
    freopen("bellmanford.in","r",stdin);
    freopen("bellmanford.out","w",stdout);

    citire();

    return 0;
}