#include <fstream>
#include <vector>
#include <deque>
#define dim 50001
#define inf 100000000
using namespace std;
ifstream fin ("bellmanford.in");
ofstream fout ("bellmanford.out");
int n, m, i, d[dim], f[dim], viz[dim];
int x, y, z;
vector <pair <int, int > > L[dim];
deque <int> q;
int main()
{
    fin>>n>>m;
    for (i=1; i<=m; i++)
    {
        fin>>x>>y>>z;
        L[x].push_back({y,z});
    }
    for (i=2; i<=n; i++)
        d[i]=inf;
    while (!q.empty())
    {
        int nod=q.front();
        viz[nod]=0;
        for (i=0; i<L[nod].size(); i++)
        {
            int vecin=L[nod][i].first;
            int cost=L[nod][i].second;
            if (d[vecin]>d[nod]+cost)
            {
                d[vecin]=d[nod]+cost;
                if (!viz[vecin])
                {
                    viz[vecin]=1;
                    f[vecin]++;
                    q.push_back(vecin);
                    if (f[vecin]==n)
                    {
                        fout<<"Ciclu negativ!";
                        return 0;
                    }
                }
            }
        }
        q.pop_front();
    }
    for (i=2; i<=n; i++)
        fout<<d[i]<<" ";
}