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

# define NMax 50005
# define INF 0x3f3f3f3f
using namespace std;

int d[NMax], ciclu[NMax];
int n, m, x, y, c;

queue < int > q;
vector < int > G[NMax], C[NMax];

int bellmanfordBFS(int x0)
{
    for(int i=1; i<=n; ++i)
        d[i] = INF;

    d[x0] = 0;
    q.push(x0);

    while(!q.empty()){

        int x = q.front();

        ciclu[x]++;
        if(ciclu[x] > n){
            return -1;
        }
        for(int i=0; i<G[x].size(); ++i)
            if(d[G[x][i]] > d[x] + C[x][i]) {
                ///relaxare muchii
                d[G[x][i]] = d[x] + C[x][i];
                q.push(G[x][i]);
            }
        q.pop();
    }
    return 1;
}
int main()
{
    freopen("bellmanford.in", "r", stdin);
    freopen("bellmanford.out","w", stdout);

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

    int c = bellmanfordBFS(1);

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

    return 0;
}