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

using namespace std;

const int nmax=50005;
const int inf=1e9;

typedef pair<int,int> ii;
vector<ii> g[nmax];
int dist[nmax];
int cnt[nmax],n,m;

int main()
{
    freopen("bellmanford.in","r",stdin);
    freopen("bellmanford.out","w",stdout);
    int x,y,i,c;
    scanf("%d%d",&n,&m);
    for(i=1;i<=m;++i)
    {
        scanf("%d%d%d",&x,&y,&c);
        g[x].push_back(ii(y,c));
    }
    queue<int> q;
    for(i=2;i<=n;++i)
        dist[i]=inf;
    q.push(1);
    cnt[1]++;
    int node,sz,currnode,currcost;
    while(!q.empty())
    {
        node=q.front();
        q.pop();
        sz=g[node].size();
        for(i=0;i<sz;++i)
        {
            currnode=g[node][i].first;
            currcost=g[node][i].second;
            if(dist[node]+currcost<dist[currnode])
            {
                dist[currnode]=dist[node]+currcost;
                cnt[currnode]++;
                if(cnt[currnode]==n)
                {
                    printf("Ciclu negativ!");
                    return 0;
                }
                q.push(currnode);
            }
        }
    }
    for(i=2;i<=n;++i)
        printf("%d ",dist[i]);
}