#include <fstream>
#include<vector>
#include<queue>
#include<climits>
#define INF INT_MAX
using namespace std;
ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");
int n,m,x,y,c;
struct elem
{
    int vecin,cost;
};
vector<elem>v[50001];
queue<int>q;
int fr[50001],d[50001];
bool viz[50001],ok;
void bellmanford(int start)
{
    q.push(start);
    ok=0;
    while(!q.empty()&&!ok)
    {
        int nod=q.front();
        q.pop();
        fr[nod]++;
        if(fr[nod]>=n)
            ok=1;
        for(int i=0;i<v[nod].size();i++)
        {
            int vecin=v[nod][i].vecin;
            int cost=v[nod][i].cost;
            if(d[vecin]>d[nod]+cost)
                {
                    d[vecin]=d[nod]+cost;
                    q.push(vecin);
               }
        }
    }
}
int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        v[x].push_back({y,c});
    }
    for(int i=2;i<=n;i++)
        d[i]=INF;
    bellmanford(1);
    if(ok==1)
    {
        fout<<"Ciclu negativ!";
        return 0;
    }
    for(int i=2;i<=n;i++)
        fout<<d[i]<<" ";
    return 0;
}