#include <fstream>
#include <limits.h>
#include <queue>
#define nmax 50004
#define f first
#define s second
using namespace std;
ifstream f("bellmanford.in");
ofstream g("bellmanford.out");

int n, m, a, b, c, dist[nmax], seen[nmax];
bool ok=true;
vector<pair<int, int> > G[nmax];
queue<int> q;

int main()
{
    f>>n>>m;
    for(int i=1;i<=m;i++) {
        f>>a>>b>>c;
        G[a].push_back({b, c});
    }

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

    q.push(1);
    while(!q.empty() && ok) {
        int node=q.front();
        q.pop();
        for(auto i:G[node])
            if(seen[i.f]<n && dist[node]+i.s<dist[i.f]) {
                dist[i.f]=dist[node]+i.s;
                seen[i.f]++;
                q.push(i.f);
            }
            else if(seen[i.f]>=n)
                ok=false;
    }

    if(ok==false)
        g<<"Ciclu negativ!";
    else {
        for(int i=2;i<=n;i++)
            g<<dist[i]<<' ';
    }

    f.close();
    g.close();
    return 0;
}