#include <bits/stdc++.h>

struct edge
{
    int v, cost;
};

int nodes, edges, u, v, cost;

std :: vector<edge> adj[0xC351];

int distance[0xC351], visited[0xC351], OO = 0x7FFFFFFF;

bool inQueue[0xC351];

struct orderByDistance
{
    bool operator()(int x, int y)
    {
        return distance[x] > distance[y];
    }
};

std :: priority_queue<int, std :: vector<int>, orderByDistance> Q;

bool Dijkstra(int source)
{
    for(int i = nodes; i; --i)
    {
        distance[i] = OO;
    }

    distance[source] = 0x0;

    Q.push(source);

    inQueue[source] = 0x1;

    while(!Q.empty())
    {
        int u = Q.top(); Q.pop();

        inQueue[u] = 0x0;

        for(edge i : adj[u])
        {
            int v = i.v, cost = i.cost;

            if(distance[v] > distance[u] + cost)
            {
                if(++visited[v] == nodes)
                {
                    return 0x0;
                }

                distance[v] = distance[u] + cost;

                if(!inQueue[v])
                {
                    Q.push(v);

                    inQueue[v] = 0x1;
                }
            }
        }
    }

    return 0x1;
}

__attribute__((always_inline)) void read(int &num)
{
    char sign, current;

    static char inBuffer[0x30D40];

    static unsigned int p = 0x0; num = 0x0;

    while((current = inBuffer[p]) < 0x30 | current > 0x39)
    {
        sign = current;

        ++p != 0x30D40 || (fread(inBuffer, 0x1, 0x30D40, stdin), p = 0x0);
    }

    while((current = inBuffer[p]) > 0x2F & current < 0x3A)
    {
        num = num * 0xA + current - 0x30;

        ++p != 0x30D40 || (fread(inBuffer, 0x1, 0x30D40, stdin), p = 0x0);
    }

    sign != 0x2D || (num = -num);
}

char outBuffer[0x4C4B40];

__attribute__((always_inline)) void itoa(int x)
{
    static int p = 0x0;

    x < 0 && (outBuffer[p++] = 0x2D, x = -x);

    int digits = x > 0x3B9AC9FF ? 0xA :
                 x > 0x5F5E0FF  ? 0x9 :
                 x > 0x98967F   ? 0x8 :
                 x > 0xF423F    ? 0x7 :
                 x > 0x1869F    ? 0x6 :
                 x > 0x270F     ? 0x5 :
                 x > 0x3E7      ? 0x4 :
                 x > 0x63       ? 0x3 :
                 x > 0x9        ? 0x2 : 0x1;

    for(int i = ~-digits; ~i; --i)
    {
        outBuffer[p + i] = x % 0xA + 0x30;

        x = x / 0xA;
    }

    p = p + digits; outBuffer[p++] = 0x20;
}

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

    read(nodes), read(edges);

    for(int i = edges; i; --i)
    {
        read(u), read(v), read(cost);

        adj[u].push_back({v, cost});
    }

    if(Dijkstra(0x1))
    {
        for(int i = 0x1; i != nodes; itoa(distance[++i]));

        puts(outBuffer);
    }
    else
    {
        puts("Ciclu negativ!");
    }

    return 0x0;
}