#include <fstream>
#include <vector>
#include <queue>

using namespace std;

#define inf 0x3f3f3f3f
#define pii pair<int, int>

ifstream cin("bellmanford.in");
ofstream cout("bellmanford.out");

int n, m;
vector<pii> ad[50001];
vector<int> dist;

bool bad=false;
void fordfocus(int k)
{
    dist=vector<int>(n+1, inf);
    vector<int> optcnt(n+1);

    priority_queue<pii, vector<pii>, greater<pii>> pq;
    dist[k]=0;
    pq.push({0, k});

    while(!pq.empty())
    {
        pii f=pq.top();
        int nod=f.second;
        int cost=f.first;
        pq.pop();

        if(dist[nod]!=cost)
            continue;

        for(auto& x:ad[nod])
        {
            int to=x.first;
            int cost=x.second;

            if(dist[to]>dist[nod]+cost)
            {
                dist[to]=dist[nod]+cost;
                pq.push({dist[to], to});
                optcnt[to]++;
            }

            if(optcnt[to]==n)
            {
                bad=true;
                return;
            }
        }
    }
}

int main()
{
    cin.tie(0);
    ios_base::sync_with_stdio(0);

    cin>>n>>m;
    for(int i=1; i<=m; i++)
    {
        int x, y, z;
        cin>>x>>y>>z;
        ad[x].push_back({y, z});
    }

    fordfocus(1);

    if(bad)
    {
        cout<<"Ciclu negativ!";
        return 0;
    }

    for(int i=2; i<=n; i++)
        cout<<dist[i]<<' ';

    return 0;
}