#include<cstdio>
#include<vector>
#include<deque>
#include<bitset>
using namespace std;
const int nmax = 50005;
int i,n,m,x,y,c,cnt[nmax],d[nmax];
vector<pair<int,int> > v[nmax];
bitset<nmax> inq;
deque<int> q;
int main()
{
	freopen("bellmanford.in","r",stdin);
	freopen("bellmanford.out","w",stdout);
	scanf("%d%d",&n,&m);
	for(;m;m--)
	{
	    scanf("%d%d%d",&x,&y,&c);
	    v[x].push_back(make_pair(y,c));
	}
	for(i=2;i<=n;i++) d[i]=1<<30;
	q.push_back(1); inq[1]=1;
	while(!q.empty())
	{
	    x=q.front(); q.pop_front(); inq[x]=0;
	    cnt[x]++; if(cnt[x]==n) {printf("Ciclu negativ!\n"); return 0;}
	    for(vector<pair<int,int> >::iterator it=v[x].begin();it!=v[x].end();it++)
            if(d[x]+it->second<d[it->first])
            {
                d[it->first]=d[x]+it->second;
                if(!inq[it->first])
                {
                    q.push_back(it->first);
                    inq[it->first]=1;
                }
            }
	}
	for(i=2;i<=n;i++) printf("%d ",d[i]);
	return 0;
}