#include <fstream>
#include <queue>
#include <climits>
#define dim 50001
#define mch 250001
#include <vector>
using namespace std;
ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");

int viz[dim], iq[dim], dp[dim];
queue <int> q;

struct muchie{
    int nod, cost;
};

vector <muchie> l[dim];

int main()
{
    int n, m, i, x, y, c;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        l[x].push_back({y, c});
    }
    q.push(1);
    viz[1]=1;
    iq[1]=1;
    for(i=2;i<=n;i++)
    {
        dp[i]=INT_MAX;
    }
    while(!q.empty())
    {
        int nod=q.front();
        q.pop();
        viz[nod]=0;
        for(int i=0;i<l[nod].size();i++)
        {
            int vecin=l[nod][i].nod;
            int cost=l[nod][i].cost;
            if(dp[vecin]>dp[nod]+cost)
            {
                dp[vecin]=dp[nod]+cost;
                if(viz[vecin]==0)
                {
                    iq[vecin]++;
                    if(iq[vecin]>n)
                    {
                        fout<<"Ciclu negativ!";
                        return 0;
                    }
                    viz[vecin]=1;
                    q.push(vecin);
                }
            }
        }
    }
    for(i=2;i<=n;i++)
    {
        fout<<dp[i]<<" ";
    }
}