#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define INF 2147483647
using namespace std;
ifstream fi("bellmanford.in");
ofstream fo("bellmanford.out");
int n,m;
vector <pair<int,int> >V[50005];
queue <int> coada;
int D[50005];
int apare[50005];
int noD[50005];
void BellmanFordMoore(int vertex)
{
    coada.push(vertex);
    int negativeCycle=0;
    while(!coada.empty() && !negativeCycle)
    {
        int node=coada.front();
        coada.pop();
        apare[node]=0;
        for(int i=0;i<V[node].size();i++)
        {
            if(D[node]<INF)
            {
                int vecin=V[node][i].first;
                int dist=V[node][i].second;
                if(D[node]+dist<D[vecin])
                {
                    D[vecin]=D[node]+dist;
                    if(noD[vecin]>n)
                    {
                        negativeCycle=1;
                        i=V[node].size();
                        continue;
                    }
                    else
                    {
                        coada.push(vecin);
                        apare[vecin]=1;
                        noD[vecin]+=noD[node];
                    }
                }
            }
            cout<<1<<endl;
        }
    }
    if(negativeCycle)
        fo<<"Ciclu negativ!";
    else
    {
        for(int i=2;i<=n;i++)
            fo<<D[i]<<" ";
    }
}
int main()
{
    fi>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x,y,cost;
        fi>>x>>y>>cost;
        V[x].push_back(make_pair(y,cost));
    }
    for(int i=2;i<=n;i++)
        D[i]=INF;
    D[1]=0;
    int source=1;
    BellmanFordMoore(source);
    return 0;
}