#include <fstream>
#include <vector>
#include <queue>
#include <climits>
using namespace std;
ifstream cin("bellmanford.in");
ofstream cout("bellmanford.out");
int viz[50001],i,n,m,p,x,y,d[50001],di,ok;
struct muchie{
    int x,c;
};
vector <muchie> v[50001];
queue <int> q;
int coada(int x){
    int i,l,nod,cost,vecin;
    q.push(x);
    while(!q.empty()){
        nod=q.front();
        q.pop();
        for(i=0;i<v[nod].size();i++){
            vecin=v[nod][i].x;
            cost=v[nod][i].c;
            if(d[vecin]>d[nod]+cost){
                d[vecin]=d[nod]+cost;
                viz[vecin]++;
                q.push(vecin);
                if(viz[vecin]>=n){
                    cout<<"Ciclu negativ!";
                    return 1;
                }
            }
        }
    }




}
int main()
{

    cin>>n>>m;
    for(i=1;i<=m;i++){
        cin>>x>>y>>di;
        v[x].push_back({y,di});
    }
    for(i=2;i<=n;i++)
        d[i]=INT_MAX;
    p=1;
    viz[p]=1;
    ok=coada(p);
    if(ok==1)
        return 0;
    for(i=2;i<=n;i++)
        cout<<d[i]<<" ";

    return 0;
}