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

vector<pair<int,int> >g[MAX];
queue<int>s,v;

int n,d[MAX];

void bellman_ford(){
    bool ok = 0;
    for(int i=2;i<=n;i++)d[i] = INF;
    s.push(1);
int x,y,c;
    for(int k=1;k<=n;k++)
    {
        ok = 0;
        while(s.size() > 0)
        {
            x = s.front();
            s.pop();
            for(int i=0;i<g[x].size();i++)
            {
                y = g[x][i].second;
                c = g[x][i].first;
                if(d[y] > d[x] + c)
                {
                    ok = 1;
                    d[y] = d[x] + c;
                    v.push(y);
                }
            }
        }
        swap(s,v);
    }
    if(ok)printf("Ciclu negativ!\n"); else
    for(int i=2;i<=n;i++)printf("%d ",d[i]);
}

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