#include <bits/stdc++.h>
using namespace std;
ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");
#define int long long
const int NMAX = 50001, INF = 1e18;
vector<pair<int, int>> vec[NMAX];
int vis[NMAX], dist[NMAX], n, m;

bool bellmanford(int start)
{
    for(int i = 1; i <= n; i++)
        dist[i] = INF;

    dist[start] = 0;
    queue<int> q;
    q.push(start);
    while(!q.empty())
    {
        int nod = q.front();
        q.pop();
        for(auto i : vec[nod])
        {
            if(dist[i.first] > dist[nod] + i.second)
            {
                dist[i.first] = dist[nod] + i.second;
                vis[i.first]++;
                if(vis[i.first] > n)
                    return false;
                q.push(i.first);
            }
        }
    }
    return true;
}

signed main()
{
    fin >> n >> m;
    while(m--)
    {
        int i, j, cost;
        fin >> i >> j >> cost;
        vec[i].push_back({j, cost});
    }
    bool good = bellmanford(1);
    if(!good)
        fout << "Ciclu negativ!";
    else
    {
        for(int i = 2; i <= n; i++)
            fout << (dist[i] == INF ? 0 : dist[i]) << ' ';
    }

    return 0;
}