#include <fstream>
#include <vector>
#include <queue>
#define MX 2000000000
using namespace std;
ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");
vector <pair <int, int> > a[50004];
int n,m,x,y,c,v[50004],d[50004],a1[50004],p,u;
queue <int> q;
int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        a[x].push_back(make_pair(y,c));
        if(i<=n)
        d[i]=MX;
    }
    d[1]=0;
    q.push(1);
    while(q.empty()==false)
    {
        int i=q.front();
        v[i]=0;
        q.pop();
        for(int j=0;j<a[i].size();j++)
        {
            int vecin=a[i][j].first;
            c=a[i][j].second;
            if(d[vecin]>d[i]+c)
            {
                d[vecin]=d[i]+c;
                if(v[vecin]==0)
                {
                    q.push(vecin);
                    v[vecin]=1;
                    a1[vecin]++;
                    if(a1[vecin]==n)
                    {
                        fout<<"Ciclu negativ!";
                        return 0;
                    }
                }
            }
        }
    }
    for(int i=2;i<=n;i++)
        fout<<d[i]<<" ";
    return 0;
}