#include <iostream>
using namespace std;
int n;
int m;
int a;
int b;
int c;
int ok=1;
int v[100];
int predecessor[100];
int edges[100][100];
int main()
{
    cin>>n;
    cin>>m;
    for (int i=1;i<=m;i++)
    {
        cin>>a;
        cin>>b;
        cin>>c;
        edges[a][b]=c;
    }
    v[1]=0;
    for (int i=2;i<=n;i++)
    v[i]=5000;

    for (int i=1;i<=n-1;i++)
        {
            for (int j=1;j<=n;j++)
            for (int z=1;z<=n;z++)
            {
                if (edges[j][z]!=0)
                {
                    if (v[j]+edges[j][z]<v[z])
                        {
                             v[z]=v[j]+edges[j][z];
                             predecessor[z]=j;
                        }
                }
            }
        }

    for (int j=1;j<=n;j++)
    for (int z=1;z<=n;z++)
    {
        if (edges[j][z]!=0)
        if (v[j]+edges[j][z]<v[z])
        {cout<<"Ciclu negativ!"<<endl;
        ok=0;
        break;}
    }
    if (ok==1)
    {cout<<"cost minim"<<endl;
    for (int i=2;i<=n;i++)
    cout<<v[i]<<" "<<endl;}
    return 0;
}