#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <queue>

using namespace std;

#define MAXN 50002

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

vector < pair < int, int > > v[MAXN];
queue < int > q;

int n,m,c[MAXN],nr[MAXN];

void solve()
{
    for(int i=2;i<=n;i++)
        c[i]=1<<30;
    q.push(1);
    while(!q.empty())
    {
        int nod=q.front();
        q.pop();
        for(int i=0;i<v[nod].size();i++)
        {
            if(c[v[nod][i].first] > c[nod] + v[nod][i].second)
            {
                c[v[nod][i].first]=c[nod]+v[nod][i].second;
                q.push(v[nod][i].first);
                nr[v[nod][i].first]++;
                if(nr[v[nod][i].first]>n){
                    fout<<"Ciclu negativ!\n"<<endl;
                    return;
                }
            }
        }
    }
    for(int i=2;i<=n;i++)
        fout<<c[i]<<" ";
}

int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int a,b,c;
        fin>>a>>b>>c;
        v[a].push_back(make_pair(b,c));
    }
    solve();
    fin.close();
    fout.close();
    return 0;
}