#include <vector>
#include <fstream>
#include <queue>

using namespace std;
ifstream cin("bellmanford.in");
ofstream cout("bellmanford.out");

int n,m,i,x,y,c;
const int inf=2000000000;
int cost[50005],ap[50005];
vector < pair<int,int> > v[50005];
queue <int> q;

void bfs (int nod)
{
    for(i=1;i<=n;++i) cost[i]=inf;

    cost[nod]=0;
    q.push(nod);

    while(!q.empty())
    {
        int x= q.front();
        ++ap[x];
        q.pop();

        if(ap[x]>n)
        {
            cout<<"Ciclu negativ!";
            return;
        }

        for(int i=0;i<v[x].size();++i)
        {
            if(cost[v[x][i].first] > cost[x]+v[x][i].second)
                {
                    cost[v[x][i].first]=cost[x]+v[x][i].second;
                    q.push(v[x][i].first);
                }
        }

    }

    for(i=2;i<=n;++i)
        cout<<cost[i]<<" ";
}
int main()
{
    cin>>n>>m;
    for(i=1;i<=m;++i)
    {
        cin>>x>>y>>c;
        v[x].push_back(make_pair(y,c));
    }

    bfs(1);

    return 0;
}