#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <climits>
using namespace std;
ifstream in("bellmanford.in");
ofstream out("bellmanford.out");
int n,m,dp[50005],a,b,c,x,y,f[50005];
struct eee
{
    int nod,cost;
};
vector <eee>v[50005];
queue <eee>q;
int main()
{
    in>>n>>m;
    for(int i=1;i<=m;i++)
    {
        in>>a>>b>>c;
        v[a].push_back({b,c});
    }
    q.push({1,0});
    for(int i=2;i<=n;i++)dp[i]=INT_MAX;
    while(!q.empty())
    {
        x=q.front().nod;
        y=q.front().cost;
        q.pop();
        if(f[x]!=n)
        {
            f[x]++;
            for(auto i:v[x])
            {
                if(dp[i.nod]>dp[x]+i.cost)
                {
                    dp[i.nod]=dp[x]+i.cost;
                    q.push({i.nod,dp[i.nod]});
                }
            }
        }
        else
        {
            out<<"Ciclu negativ!";
            return 0;
        }
    }
    for(int i=2;i<=n;i++)
    {
        if(dp[i]==INT_MAX)
        {
            out<<0<<' ';
        }
        else out<<dp[i]<<' ';
    }
    return 0;
}