#include <fstream>
#include <vector>
#include <queue>
#include <utility>
using namespace std;
vector<pair<int,int> >v[50005];
queue<int>Q;
int inq[50005],d[50005],n,m,x,y,c;
bool done;
ifstream fi("bellmanford.in");
ofstream fo("bellmanford.out");
void bellman()
{
    for(int i=1;i<=n;i++) d[i]=int(2e9);
    Q.push(1); inq[1]=1; d[1]=0; done=0;
    while(!Q.empty() and !done)
    {
        x=Q.front(); inq[x]=0; Q.pop();
        for(int i=0;i<v[x].size();i++)
        if(d[v[x][i].first]>d[x]+v[x][i].second)
        {
            d[v[x][i].first]=d[x]+v[x][i].second;
            if(!inq[v[x][i].first])
            {
                if(inq[v[x][i].first]>m) done=1;
                inq[v[x][i].first]++;
                Q.push(v[x][i].first);
            }
        }

    }
    if(done) fo<<"Ciclu negativ!";
    else
    for(int i=2;i<=n;i++) fo<<d[i]<<" ";
    fo<<"\n";
}
int main()
{
    int i;
    fi>>n>>m;
    for(i=1;i<=m;i++)
    {
        fi>>x>>y>>c;
        v[x].push_back(make_pair(y,c));
    }
    bellman();
    return 0;
}