#include <fstream>
#include <vector>
#define N 50002
#include <deque>
#define INF 2000000000

using namespace std;
ifstream f("bellmanford.in");
ofstream g("bellmanford.out");

struct bla
{
    int ve,co;
};
vector <bla> graph[N];
bool been[N];
int fr[N],n,ok,dist[N];
deque <int> q;

void bf(int nod)
{
    int vee;
    q.push_back(nod);
    dist[nod]=0;
    ++fr[nod];
    while(!q.empty())
    {
        nod=q.front();
        q.pop_front();
        been[nod]=0;
        for(int i=0;i<graph[nod].size();++i)
        {
            vee=graph[nod][i].ve;
            if(dist[vee]>dist[nod]+graph[nod][i].co)
            {
                dist[vee]=dist[nod]+graph[nod][i].co;
                    q.push_back(vee);
                    ++fr[vee];
                    if(fr[vee]>n)
                    {
                        ok=1;
                        g<<"Ciclu negativ!";
                        return;
                    }
            }
        }
    }
}
int main()
{
    int m,x,y,z;
    f>>n>>m;
    for(int i=1;i<=m;++i)
    {
        f>>x>>y>>z;
        graph[x].push_back({y,z});
    }
    for(int i=1;i<=n;++i) dist[i]=INF;
    bf(1);
    if(!ok)
        for(int i=2;i<=n;++i) g<<dist[i]<<" ";
    f.close();
    g.close();
    return 0;
}