#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define inf 1000000007
using namespace std;
ifstream fin ("bellmanford.in");
ofstream fout("bellmanford.out");
int n,m,a,b,c,d[50010];
vector <pair<int,int> > v[50010];
int main()
{
    fin>>n>>m;
    for(;m;m--)
    {
        fin>>a>>b>>c;
        v[a].push_back(make_pair(b,c));
    }
    d[1]=0;
    for(int i=2;i<=n;i++)
        d[i]=inf;
    queue <int> q;
    q.push(1);
    while(!q.empty())
    {
        a=q.front();
        q.pop();
        for(auto it:v[a])
        {
            if(d[it.first]>it.second+d[a])
            {
                d[it.first]=it.second+d[a];
                q.push(it.first);
            }
        }
    }
    for(int i=2;i<=n;i++)
    {
        if(d[i]!=inf)
        {
            for(auto it:v[i])
            {
                if(it.first==1&&d[i]!=inf&&d[i]+it.second<0)
                {
                    fout<<"Ciclu negativ!";
                    return 0;
                }
            }
        }

    }
    for(int i=2;i<=n;i++)
        fout<<d[i]<<" ";

    return 0;
}