#include <fstream>
#include <vector>
#include <queue>
#define f first
#define s second
const int NMAX=50005;

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

int f[NMAX], dist[NMAX];
vector <pair<int, int>> v[NMAX];
queue <int> c;
int n, m;

void bellman(int);

int main()
{
    int i, a, b, c;
    cin>>n>>m;
    for(i=1; i<=m; i++)
    {
        cin>>a>>b>>c;
        v[a].push_back({b, c});
    }
    bellman(1);
    return 0;
}

void bellman(int nod)
{
    int i, p;
    for(i=1; i<=n; i++) dist[i]=1e9;
    dist[nod]=0;
    c.push(nod);
    while(!c.empty())
    {
        p=c.front(); c.pop();
        f[p]++;
        if(f[p]==n+1)
        {
            cout<<"Ciclu negativ!\n";
            return;
        }
        for(auto i:v[p])
        {
            if(dist[i.f]>dist[p]+i.s)
            {
                dist[i.f]=dist[p]+i.s;
                c.push(i.f);
            }
        }
    }
    for(i=2; i<=n; i++) cout<<dist[i]<<' ';
}