#include<cstdio>
#include<vector>
#include<queue>
#include<cstring>
#define INF 0x3f3f3f3f
#define MAXN 50010

using namespace std;
typedef vector <pair<int,int> >::iterator iter;
bool ok(true);
vector <pair<int,int> > g[MAXN];
int dist[MAXN],nr[MAXN],i,m,n,x,y,c,nod,j;
queue <int>q;
void solve()
{
    memset(dist,INF,sizeof(dist));
    q.push(1);
    dist[1]=0;
    while(!q.empty())
    {
        nod=q.front();
        q.pop();
        ++nr[nod];
        if(nr[nod]==n) {ok=false; break;}
        for(iter it=g[nod].begin(); it!=g[nod].end(); ++it)
            if(dist[nod]+it->second<dist[it->first])
            {
                dist[it->first]=dist[nod]+it->second;
                q.push(it->first);
            }
    }
}

int main()
{
    freopen("bellmanford.in","r",stdin);
    freopen("bellmanford.out","w",stdout);
    scanf("%d%d",&n,&m);
    j=1;
    for(j=1;j<=m;++j)
    {
        scanf("%d%d%d",&x,&y,&c);
        g[x].push_back(make_pair(y,c));

    }
    solve();
    if(ok)
        for(i=2;i<=n;++i)
            printf("%d ",dist[i]);
    else printf("Ciclu negativ!");
    return 0;
}