#include <bits/stdc++.h>
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define ll long long

using namespace std;
unsigned seed=chrono::system_clock::now().time_since_epoch().count();
mt19937 rng(seed);
#define rand() rng()
/*const long long mod = 998244353;
long long fct[200005],invfct[200005],inv[200005];
long long put2[200005];
long long lgput (long long a, long long exp)
{
    long long rz=1;
    while(exp)
        if(exp&1)
            exp^=1,rz=rz*1LL*a%mod;
        else
            exp>>=1,a=a*1LL*a%mod;
    return rz;
}
long long cmb (long long n, long long k)
{
    if(n<k || k<0 || n<0)
        return 0;
    return fct[n]*1LL*invfct[k]%mod*1LL*invfct[n-k]%mod;
}
void init ()
{
    inv[1]=fct[0]=fct[1]=invfct[0]=invfct[1]=put2[0]=1,put2[1]=2;
    for(long long i=2;i<=200000;++i)
        put2[i]=put2[i-1]*2LL%mod,inv[i]=(mod-mod/i)*1LL*inv[mod%i]%mod,fct[i]=i*1LL*fct[i-1]%mod,invfct[i]=inv[i]*1LL*invfct[i-1]%mod;
}
long long v[200005];*/
#include <fstream>
ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");
const int N=50005;
struct edge
{
    int to,cost;
};
vector<edge> v[N];
int d[N],cnt[N];
const int inf=1e9;
bool inq[N];
queue<int> q;
void solve()
{
    int n,m;
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x,y,c;
        fin>>x>>y>>c;
        v[x].pb({y,c});
    }
    d[1]=0;
    for(int i=2;i<=n;i++)
        d[i]=inf;
    q.push(1);
    while(!q.empty())
    {
        int x=q.front();
        q.pop();
        inq[x]=false;
        for(auto it:v[x])
        {
            int y=it.to;
            int c=it.cost;
            int dist=d[x]+c;
            if(dist<d[y])
            {
                d[y]=dist;
                if(!inq[y])
                {
                    inq[y]=true;
                    q.push(y);
                    cnt[y]++;
                    if(cnt[y]>n)
                    {
                        fout<<"Ciclu negativ!";
                        return ;
                    }
                }
            }
        }
    }
    for(int i=2;i<=n;i++)
        fout<<d[i]<<" ";
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t=1;
    //cin>>t;
    while(t--)
        solve();
    return 0;
}