#include <fstream>
#include <queue>
#include <vector>
#define NMAX 50002
#define INF 1e9
using namespace std;
ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");
struct varf {int x,c;};
int n,x0=1,aux,m;
vector <varf> G[NMAX];
bool uz[NMAX];
int cmin[NMAX];
int pre[NMAX];
int nr[NMAX];
queue <int> C;
void citire();
bool bell();
void afisare();

int main()
{
    citire();
    aux=bell();
    if(aux==0)
        fout<<"Ciclu negativ!";
else
    afisare();
    return 0;
}
void citire()
{
    int i,j,c;
    varf aux;
   fin>>n>>m;
   while(fin>>i>>j>>c)
   {
    aux.x=j;
    aux.c=c;
    G[i].push_back(aux);
   }
   for(i=1;i<=n;i++)
      cmin[i]=INF;
   cmin[x0]=0;
}
bool bell()
{
    int x,vf,cost;
    C.push(x0);
    nr[x0]=1;
    while(!C.empty())
    {
      x=C.front();
      C.pop();
      ///parcurg lista de adiancenta a lui x
      for(int i=0;i<G[x].size();i++)
      {
         vf=G[x][i].x;
         cost=G[x][i].c;
         if(cmin[vf]>cmin[x]+cost)
         {
            cmin[vf]=cmin[x]+cost;
            C.push(vf);
            nr[vf]++;
            if(nr[vf]==n)
               return 0;
         }
      }
    }
    return 1;
}
void afisare()
{
  for(int i=2;i<=n;i++)
     fout<<cmin[i]<<" ";
}