#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream f("bellmanford.in");
ofstream g("bellmanford.out");
int n,m;
const int inf=100000000;
typedef pair<int,int> pint;
vector<vector<pint>>G(50005);
vector <int> d(50005,inf);
bool inq[50005];
int l[50005];
void spfa(int start)
{
    queue <int>q;
    bool CN=0;
    d[start]=0;
    q.push(start);
    inq[start]=1;
    while(!q.empty()&&!CN)
    {
        int u=q.front();
        inq[u]=0;
        q.pop();
        for(int i=0;i<G[u].size()&&!CN;i++)
        {
            int v=G[u][i].second;
            int w=G[u][i].first;
            if (d[u] + w < d[v])
            {
                l[v] = l[u] + 1;
                if (l[v] == n)
                    CN=1;
                d[v] = d[u] + w;
                if (!inq[v])
                    q.push(v);
            }

        }
    }
    if(!CN)
    for(int i=2;i<=n;i++)
        g<<d[i]<<" ";
    else
        g<<"Ciclu negativ!";
}
int main()
{
    f>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x,y,c;
        f>>x>>y>>c;
        G[x].push_back(make_pair(c,y));
    }
    spfa(1);
    return 0;
}