#include <cstdio>
#include <vector>
#include <queue>
#include <cstring>
#define inf 0x3f3f3f3f
#define nmax 50005
#define vecin second
#define cost first

using namespace std;

int n,m,viz[nmax],nrit[nmax],d[nmax];
bool ok=1;
vector<pair<int,int> >g[nmax];
queue<int> q;

void citire()
{
    int x,y,c;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d%d",&x,&y,&c);
        g[x].push_back(make_pair(c,y));
    }
    memset(d,inf,sizeof(d));
}

void rezolv()
{
    int k;
    d[1]=0;
    q.push(1);
    while(!q.empty())
    {
        k=q.front();
        q.pop();
        viz[k]=0;
        for(vector<pair<int,int> >::iterator ii=g[k].begin();ii!=g[k].end();++ii)
            if(d[ii->vecin]>d[k]+ii->cost)
            {
                d[ii->vecin]=d[k]+ii->cost;
                if(viz[ii->vecin]==0)
                {
                    q.push(ii->vecin);
                    viz[ii->vecin]=1;
                    nrit[ii->vecin]++;
                    if(nrit[ii->vecin]>n)
                    {
                        ok=0;
                        break;
                    }
                }
            }
            if(ok==0)
                break;
    }
}

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

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