#include <fstream>
#include <vector>
#include <queue>
#define pb push_back
#define mp make_pair
using namespace std;
ifstream f("bellmanford.in");
ofstream g("bellmanford.out");
int x,y,z,i,n,m,dist[50001],nod,l[50001],neg;
vector <pair <int,int>> G[50001];
priority_queue < pair<int,int> ,vector<pair<int,int> > , greater<pair<int,int> > > Q;
void Bellman(int surs, int &neg)
{
    int i,v,c,pas=0;
    neg=0;
    for(i=1;i<=n;i++) {dist[i]=1<<30; l[i]=0;}
    dist[surs]=0;
    Q.push(mp(0,1));
    while(!Q.empty())
    {
        nod=Q.top().second;
        Q.pop();
        for(i=0;i<G[nod].size();i++)
        {
            v=G[nod][i].first;
            c=G[nod][i].second;
            if(dist[v]>c+dist[nod])
            {
                dist[v]=c+dist[nod];
                l[v]=1+l[nod];
                Q.push(mp(dist[v],v));
                if(l[v]==n) {neg=1; return; }
            }
        }
    }
}
int main()
{
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>x>>y>>z;
        G[x].pb(mp(y,z));
    }
    Bellman(1,neg);
    if(neg==1) g<<"Ciclu negativ!";
    else for(i=2;i<=n;i++) g<<dist[i]<<' ';
    return 0;
}