#include<cstdio>
#include<vector>
#include<queue>

using namespace std;

int n,m;
int dist[50010];
int updated[50010];
vector< pair<int,int> > adj[50010];
queue<int> q;

int bellman_ford()
{
    for(int i=2;i<=n;i++)
    {
        dist[i]=50000001;
    }
    q.push(1);
    int nod;
    while(!q.empty())
    {
        nod=q.front();
        //printf("%d %d\n",nod,dist[nod]);
        for(vector< pair<int,int> >::iterator it=adj[nod].begin();it!=adj[nod].end();it++)
        {
            if(dist[(*it).first]>dist[nod]+(*it).second)
            {
                if(updated[nod]==n)
                {
                    return 0;
                }
                updated[nod]++;
                dist[(*it).first]=dist[nod]+(*it).second;
                q.push((*it).first);
            }
        }
        q.pop();
    }
    return 1;
}

int main()
{
    freopen("bellmanford.in","r",stdin);
    freopen("bellmanford.out","w",stdout);

    scanf("%d %d",&n,&m);

    int x,y,c;
    for(int i=1;i<=m;i++)
    {
        scanf("%d %d %d",&x,&y,&c);
        adj[x].push_back(make_pair(y,c));
    }

    if(bellman_ford()==0)
    {
        printf("Ciclu negativ!");
    }
    else
    {
        for(int i=2;i<=n;i++)
        {
            printf("%d ",dist[i]);
        }
    }
}