#include <fstream>
#include <queue>
#include <vector>
using namespace std;
ifstream cin("bellmanford.in");
ofstream cout("bellmanford.out");
#define NMAX 50005
#define inf (1<<30)
int n,m,x,c,y,v[NMAX];
vector <pair<int,int> > g[NMAX];
queue <int> q;
int inqueue[NMAX],d[NMAX];
bool Bellman_Ford(int s)
{
    q.push(s);
    inqueue[s]=1;
    d[s]=0;
    while(!q.empty())
    {
        int aux=q.front();
        q.pop();
        v[aux]++;
        if(v[aux]>=n)
            return false;
        inqueue[aux]=0;
        for(size_t i=0; i<g[aux].size(); i++)
        {
            int cost=g[aux][i].second;
            int vecin=g[aux][i].first;
            if(d[aux]+cost<d[vecin])
            {
                d[vecin]=d[aux]+cost;
                if(!inqueue[vecin])
                {
                    q.push(vecin);
                }
            }
        }
    }
    return true;
}
int main()
{
    cin>>n>>m;
    for(int i=1; i<=m; i++)
    {
        cin>>x>>y>>c;
        g[x].push_back({y,c});
    }
    for(int i=1; i<=n; i++)
        d[i]=inf;
    if(Bellman_Ford(1))
        for(int i=2; i<=n; i++)
            cout<<d[i]<<" ";
    else
        cout<<"Ciclu negativ!";
    return 0;
}