#include <cstdio>
#include <vector>
#include <algorithm>
#include <queue>
#include <cstring>

using namespace std;

const int NMAX = 50005;

#define INF 0x3f3f3f3f

int n, m;
vector < vector < pair < int, int > > > graph(NMAX);
int dist[NMAX];

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

bool bellmanford(int source)
{
    int cnt[NMAX], node;
    queue < int > Q;
    vector < pair < int, int > > :: iterator it;
    memset(dist, INF, sizeof(dist));
    memset(cnt, 0, sizeof(cnt));
    dist[source] = 0;
    Q.push(source);
    while (!Q.empty())
        {
         node = Q.front();
         Q.pop();
         for (it = graph[node].begin(); it != graph[node].end(); ++ it)
            if (dist[(*it).second] > dist[node] + (*it).first)
                {
                 dist[(*it).second] = dist[node] + (*it).first;
                 Q.push((*it).second);
                 ++ cnt[(*it).second];
                 if (cnt[(*it).second] > n)
                    return false;
                }
        }
    return true;
}

void print()
{
    int i;
    for (i = 2; i <= n; ++ i)
        printf("%d ", dist[i]);
    printf("\n");
}

int main()
{
    freopen("bellmanford.in", "r", stdin);
    freopen("bellmanford.out", "w", stdout);
    read();
    if (bellmanford(1))
        print();
    else
        printf("Ciclu negativ!\n");
    return 0;
}