#include <fstream>
#include <queue>
#include <vector>
#define inf 1001
using namespace std;
ifstream f("bellmanford.in");
ofstream g("bellmanford.out");
int n,m,d[50005],viz[50005];
bool ok;
vector < pair<int,int> > v[50001];
pair <int,int> elem;
queue <int> q;
void bf(int node)
{
    q.push(node);
    while(!q.empty())
    {
        node=q.front();
        q.pop();
        for(int i=0;i<v[node].size();++i)
        {
            if(viz[v[node][i].first]==n)
            {
            ok=1;
            return;
            }
            if(d[node]+v[node][i].second<d[v[node][i].first])
            {
                d[v[node][i].first]=d[node]+v[node][i].second;
                viz[v[node][i].first]+=1;
                q.push(v[node][i].first);
            }
        }

    }
}
int main()
{
    f>>n>>m;
    for(int i=1;i<=m;++i)
    {
        int a;
        f>>a>>elem.first>>elem.second;
        v[a].push_back(elem);
    }
    for(int i=2;i<=n;++i)
        d[i]=inf;
    bf(1);
    if(ok)
        g<<"Ciclu negativ!\n";
    else
        for(int i=2;i<=n;++i)
           g<<d[i]<<' ';
    return 0;
}