#include<cstdio>
#include<queue>
#define NMAX 50002
#define INF 100000000
using namespace std;

int n, m, d[NMAX], ItNod[NMAX];
bool used[NMAX], ok;
queue< int > Q;

struct nod
{
    int val, cost;
    nod *next;
};

nod *L[NMAX];

inline void add(int x, int y, int c)
{
    nod *p = new nod;
    p->val = y;
    p->cost = c;
    p->next = L[x];
    L[x] = p;
}

void Read()
{
    int a, b, costul, i;
    FILE *fin = fopen("bellmanford.in","r");
    fscanf(fin,"%d%d",&n,&m);
    for(i=1; i<=m; i++)
    {
        fscanf(fin,"%d%d%d",&a,&b,&costul);
        add(a,b,costul);
    }
    fclose(fin);
}

void BellmanFord()
{
    int i, Nod;
    nod *p;
    ok = false;
    for(i=1; i<=n; i++)
        d[i] = INF;
    d[1] = 0;
    Q.push(1);
    used[1] = true;
    while(!Q.empty() && !ok)
    {
        Nod = Q.front();
        Q.pop();
        used[Nod] = false;
        p = L[Nod];
        while(p != NULL)
        {
            if(d[p->val] > d[Nod] + p->cost)
            {
                d[p->val] = d[Nod] + p->cost;
                if(!used[p->val])
                {
                    Q.push(p->val);
                    used[p->val] = true;
                    if(++ItNod[p->val] > n)
                        ok = true;
                }
            }
            p = p->next;
        }
    }
}

void Write()
{
    FILE *fout = fopen("bellmanford.out","w");
    if(!ok)
    {
        for(int i=2; i<=n; i++)
            fprintf(fout,"%d ",d[i]);
        fprintf(fout,"\n");
    }
    else fprintf(fout,"Ciclu negativ!\n");
    fclose(fout);
}

int main()
{
    Read();
    BellmanFord();
    Write();
    return 0;
}