#include <fstream>
#include <vector>
#include <queue>
#define NMAX 50002
#define INF 1e9
using namespace std;
ifstream fin ("bellmanford.in");
ofstream fout("bellmanford.out");
struct arc {int x, c;};
vector <arc> G[NMAX];
queue <int> C;
int n, m, start=1;
int cmin[NMAX], nr[NMAX];
bool circuitneg=0;
int main()
{int i, x ,y, cost;
 arc vf;
 //citire
 fin>>n>>m;
 for(i=1; i<=m; i++)
    {fin>>x>>y>>cost;
     vf.x=y; vf.c=cost;
     G[x].push_back(vf);
    }


 //initializare
 for(i=1; i<=n; i++) cmin[i]=INF;
 cmin[start]=0;
 C.push(start);
 while(!C.empty() && !circuitneg)
      {x=C.front(); C.pop();
       //parcurg lista de adiacenta a lui x
       for(i=0; i<G[x].size(); i++)
          {y=G[x][i].x; cost=G[x][i].c;
           if(cmin[y]>cmin[x]+cost)
             {cmin[y]=cmin[x]+cost;
              nr[y]++;
              if(nr[y]==n) circuitneg=1;
                 else C.push(y);
             }
          }
      }
 if(circuitneg) fout<<"Ciclu negativ!"<<'\n';
    else for(i=2; i<=n; i++) fout<<cmin[i]<<' ';
 return 0;
}