# include <fstream>
# include <queue>
# define DIM 50010
# define INF 1000000000
# define f first
# define s second
using namespace std;
ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");
vector<pair<int,int> > Lista[DIM];
queue<int> q;
int Marcat[DIM],d[DIM],nr[DIM],n,m,x,y,cost,i,nc,nv;
int main () {
    fin>>n>>m;
    for(i=1;i<=m;i++){
        fin>>x>>y>>cost;
        Lista[x].push_back(make_pair(y,cost));
    }
    for(i=2;i<=n;i++)
        d[i]=INF;
    q.push(1);
    nr[1]=1;
    while(!q.empty()){
        nc=q.front();
        Marcat[nc]=0;
        q.pop();
        for(i=0;i<Lista[nc].size();i++){
            nv=Lista[nc][i].f;
            cost=Lista[nc][i].s;
            if(d[nv]>d[nc]+cost){
                d[nv]=d[nc]+cost;
                if(Marcat[nv]==0){
                    Marcat[nv]=0;
                    q.push(nv);
                    nr[nv]++;
                    if(nr[nv]==n){
                        fout<<"Ciclu negativ!\n";
                        return 0;
                    }
                }
            }
        }
    }
    for(i=2;i<=n;i++)
        fout<<d[i]<<" ";
    return 0;
}