#include <fstream>
#include <climits>
#include <queue>
#include <vector>
#define X first
#define Y second
using namespace std;
ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");
int n,m,i,x,y,z,D[50010],f[50010],N[50010];
vector<pair<int, int> > L[50010];
queue<int> q;
int main(){
    fin>>n>>m;
    for(i=1;i<=m;i++){
        fin>>x>>y>>z;
        L[x].push_back({y,z});
    }
    for(i=2;i<=n;i++)
        D[i]=1000000;
    q.push(1);
    f[1]=1;
    D[1]=0;
    while(!q.empty()){
        int nod=q.front();
        q.pop();
        f[nod]=0;
        for(int i=0;i<L[nod].size();i++){
            int vec=L[nod][i].X;
            int cost=L[nod][i].Y;
            if(D[vec]>D[nod]+cost){
                D[vec]=D[nod]+cost;
                N[nod]++;
                if(N[nod]==n){
                    fout<<"Ciclu negativ!";
                    return 0;
                }
                if(f[vec]==0){
                    q.push(vec);
                    f[vec]=1;
                }
            }
        }
    }

    for(i=2;i<=n;i++)
        fout<<D[i]<<" ";
    return 0;
}