#include <cstdio>
#include <vector>
#include <queue>

using namespace std;

const int inf=1e9;
struct edge
{
    int nod,c;
};
vector<edge> g[50010];
queue<int> q;
int d[50010],cnt[50010],n;
char vaz[50010];

int bellman_ford(int nod)
{
    for(int i=1;i<=n;i++) d[i]=inf;
    d[nod]=0;
    q.push(nod);
    vaz[nod]=1;
    while(!q.empty())
    {
        int nod=q.front();q.pop();
        for(vector<edge>::iterator it=g[nod].begin();it!=g[nod].end();it++)
            if(d[it->nod]>d[nod]+it->c)
            {
                d[it->nod]=d[nod]+it->c;
                if(!vaz[it->nod])
                {
                    if(++cnt[it->nod]==n-1) return 0;
                    q.push(it->nod);
                    vaz[it->nod]=1;
                }
            }
    }
    return 1;
}

int main()
{
    freopen("bellmanford.in", "r", stdin);
    freopen("bellmanford.out", "w", stdout);
    int m,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({y,c});
    }
    if(bellman_ford(1))
    {
        for(int i=2;i<=n;i++) printf("%d ",d[i]);
    }
    else printf("Ciclu negativ!");
    return 0;
}