#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
#define MAX 50005
#define INF 0xffffff

vector<pair<int,int> >g[MAX];
int n,d[MAX];

void bellman(){
    int y;
    bool ok = 1;
    for(int i=2;i<=n;i++)d[i]=INF;
    for(int i=1;i<=n;i++)
    {
        ok = 0;
        for(int x=1;x<=n;x++)
        for(int j=0;j<g[x].size();j++)
        {
            y=g[x][j].first;
            if(d[y] > d[x] + g[x][j].second)
            {
                ok = 1;
                d[y] = d[x] + g[x][j].second;
            }
        }
    }
    if(ok)printf("Ciclu negativ!\n"); else
    for(int i=2;i<=n;i++)printf("%d ",d[i]);
}

int main(){
    int m,x,y,z;
    freopen("bellmanford.in","r",stdin);
    freopen("bellmanford.out","w",stdout);
        scanf("%d %d",&n,&m);
        while(m--)
        {
            scanf("%d %d %d",&x,&y,&z);
            g[x].push_back(make_pair(y,z));
        }
    bellman();
    return 0;
}