#include <bits/stdc++.h>

using namespace std;
ifstream f("bellmanford.in");
ofstream g("bellmanford.out");
const int N = 50010;
const int oo = 1e8;
vector<pair<int,int>> v[N];
vector<int> d(N,oo);
deque<int> Q;
bitset<N> q;
int n,m,x,y,c,cnt[N];
int main()
{
    f>>n>>m;
    for(; m; m--)
    {
        f>>x>>y>>c;
        v[x].push_back(make_pair(y,c));
    }
    Q.push_back(1);
    q[1]=1;
    cnt[1]++;
    d[1]=0;
    while(Q.size())
    {
        x=Q.front();
        Q.pop_front();
        q[x]=0;
        for(auto it:v[x])
        {
            tie(y,c)=it;
            if(d[x]+c<d[y])
            {
                cnt[y]++;
                if(cnt[y]==n)
                {
                    g<<"Ciclu negativ!";
                    return 0;
                }
                d[y]=d[x]+c;
                if(!q[y])
                {

                    q[y]=1;
                    Q.push_front(y);
                }
            }
        }
    }
    for(int i=2; i<=n; i++)
        g<<d[i]<<' ';
    return 0;
}