#include <fstream>
#include <queue>
using namespace std;

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

int main()
{
    int n,m;
    f>>n>>m;

    vector<int> v[50001],cs[50001];

    for(int i=1;i<=m;i++){
        int x,y,c;
        f>>x>>y>>c;

        v[x].push_back(y);
        cs[x].push_back(c);
    }

    int d[50001]={},nr[50001]={};

    for(int i=2;i<=n;i++)
        d[i]=2000000000;

    queue<int> q;

    q.push(1);

    while(!q.empty()){
        int x=q.front();
        q.pop();

        for(unsigned j=0;j<v[x].size();j++)
            if(d[v[x][j]]>d[x]+cs[x][j]){
                d[v[x][j]]=d[x]+cs[x][j];
                nr[v[x][j]]++;
                q.push(v[x][j]);
                if(nr[v[x][j]]>n){
                    g<<"Ciclu negativ!";
                    return 0;
                }
            }
    }

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

    return 0;
}