#include <fstream>
#include <queue>
#include <climits>
#include <vector>
#define DIM 50001

using namespace std;

ifstream fin ("bellmanford.in");
ofstream fout("bellmanford.out");

vector<pair<int, int>>L[DIM];
queue<int>Q;
int ciclu[DIM],d[DIM];
bool viz[DIM];
int n,m,x,y,cost,k;
int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y>>cost;
        L[x].push_back(make_pair(y,cost));
    }
    Q.push(1);
    viz[1]=1;
    ciclu[1]=1;
    d[1]=0;
    for(int i=2;i<=n;i++)
        d[i]=INT_MAX;
    while(!Q.empty())
    {
        k=Q.front();
        Q.pop();
        viz[k]=0;
        for(auto vec: L[k])
        {
            int nod=vec.first, cost=vec.second;
            if(d[nod]>d[k]+cost)
            {
                d[nod]=d[k]+cost;
                ciclu[nod]++;
                if(ciclu[nod]==n)
                {
                    fout<<"Ciclu negativ!";
                    return 0;
                }
                if(viz[nod]==0)
                    Q.push(nod),viz[nod]=1;
            }
        }
    }
    for(int i=2;i<=n;i++)
        fout<<d[i]<<" ";
    return 0;
}