#include <fstream>
#include<cstring>
#include<vector>
#include<queue>
#define nmax 50005
#define INF 1000000005
using namespace std;
ifstream f("bellmanford.in");
ofstream g("bellmanford.out");
vector <int> ls[nmax],lc[nmax];
int x,y,n,m,cost,i;
queue <int> Q;
int seen[nmax],cnt[nmax];
int main()
{
    f>>n>>m;
    while(m--)
    {
        f>>x>>y>>cost;
        ls[x].push_back(y);
        lc[x].push_back(cost);
    }
    memset(seen, INF, nmax);
    seen[1]=0;
    Q.push(1);
    while(Q.empty()==0)
    {
        int old_n=Q.front();
        Q.pop();
        int l = ls[old_n].size();
        for(i=0;i<l;i++)
        {
            int new_n=ls[old_n][i];
            int new_c=lc[old_n][i];
            if(seen[old_n]+new_c<seen[new_n])
            {
                seen[new_n]=seen[old_n]+new_c;
                cnt[new_n]++;
                Q.push(new_n);
            }
            if(cnt[new_n]>=n)
            {
                g<<"Ciclu negativ";
                return 0;
            }
        }
    }
    for(i=2;i<=n;i++)
        g<<seen[i]<<" ";
    return 0;
}