#include <fstream>
#include <vector>
#include <queue>
#define INF 100000
#define NMAX 51000

using namespace std;
ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");

struct M {int nod, cost;};
vector <M> a[NMAX];
int dmin[NMAX], nr[NMAX];
queue <int> q;
int n, m, k;

void citire()
{
    int i, x;
    M muchie;
    muchie.nod=muchie.cost=0;
    fin>>n>>m;
    for(i=1; i<=n+1; i++)
    {
        a[i].push_back(muchie);
        dmin[i]=INF;
    }
    dmin[1]=0;

    for(i=1; i<=m; i++)
    {
        fin>>x>>muchie.nod>>muchie.cost;
        a[x].push_back(muchie);
        a[x][0].cost++;
    }

    q.push(1);
}

bool BF()
{
    int i, x;
    bool cneg=0;

    while(!q.empty()&&!cneg)
    {
        x=q.front();
        q.pop();

        for(i=1; i<=a[x][0].cost; i++)
            if (dmin[a[x][i].nod]>dmin[x]+a[x][i].cost)
            {
                dmin[a[x][i].nod]=dmin[x]+a[x][i].cost;
                nr[a[x][i].nod]++;
                if (nr[a[x][i].nod]==n)
                {
                    cneg=1;
                    break;
                }
                q.push(a[x][i].nod);
            }
    }
    return cneg;
}


void afisare()
{
    if (BF())
        fout<<"Ciclu negativ!";
    else
    {
        for(int i=2; i<=n; i++)
            fout<<dmin[i]<<' ';
        fout <<'\n';
    }
}

int main()
{
    citire();
    afisare();
    return 0;
}