#include <bits/stdc++.h>

#define inline __inline__ __attribute__((always_inline)) __attribute__((optimize("-O3")))

#define oo 2000000000

using namespace std;

class parser{
    public:
        parser() {}
        parser(const char *file_name){
            input_file.open(file_name,ios::in | ios::binary);
            input_file.sync_with_stdio(false);
            index&=0;
            input_file.read(buffer,SIZE);}
        inline parser &operator >>(int &n){
            for (;buffer[index]<'0' or buffer[index]>'9';inc());
            n&=0;
            sign&=0;
            sign|=(buffer[index-1]=='-');
            for (;'0'<=buffer[index] and buffer[index]<='9';inc())
                n=(n<<1)+(n<<3)+buffer[index]-'0';
            n^=((n^-n)&-sign);
            return *this;}
        ~parser(){
            input_file.close();}
    private:
        fstream input_file;
        static const int SIZE=0x200000; ///2MB
        char buffer[SIZE];
        int index,sign;
        inline void inc(){
            if(++index==SIZE)
                index=0,input_file.read(buffer,SIZE);}
};

class writer{
    public:
        writer() {};
        writer(const char *file_name){
            output_file.open(file_name,ios::out | ios::binary);
            output_file.sync_with_stdio(false);
            index&=0;}
        inline writer &operator <<(int target){
            aux&=0;
            sign&=0;
            n=target;
            if (n<0)
                sign=1,
                buffer[index]='-',
                inc();
            n^=((n^-n)&-sign);
            if (!n)
                nr[aux++]='0';
            for (;n;n/=10)
                nr[aux++]=n%10+'0';
            for(;aux;inc())
                buffer[index]=nr[--aux];
            return *this;}
        inline writer &operator <<(const char *target){
            aux&=0;
            while (target[aux])
                buffer[index]=target[aux++],inc();
            return *this;}
        ~writer(){
            output_file.write(buffer,index);output_file.close();}
    private:
        fstream output_file;
        static const int SIZE=0x200000; ///2MB
        int index,aux,n,sign;
        char buffer[SIZE],nr[24];
        inline void inc(){
            if(++index==SIZE)
                index&=0,output_file.write(buffer,SIZE);}
};

parser f ("bellmanford.in");
writer t ("bellmanford.out");

struct edge{
    int to,cost;
};

bool cycle=false;
int n,m;
vector <edge> v[50010];
vector <int> dist(50010,oo),counter(50010);

void bellmanford(int nod){
    dist[nod]=0;
    queue <int> q;
    bitset <50010> in_queue;
    q.push(nod);
    in_queue[nod]=true;
    while (!q.empty() and cycle==false){
        int current=q.front();
        q.pop();
        in_queue[current]=false;
        for (auto i:v[current])
            if (dist[i.to]>dist[current]+i.cost){
                dist[i.to]=dist[current]+i.cost;
                if (!in_queue[i.to])
                    if (counter[i.to]>n)
                        cycle=true;
                    else{
                        ++counter[i.to];
                        q.push(i.to);
                        in_queue[i.to]=true;
                    }
            }
    }
}

int main(){
    f>>n>>m;
    for (int x,y,c,i=0;i<m;++i)
        f>>x>>y>>c,
        v[x].push_back({y,c});
    bellmanford(1);
    if (cycle)
        t<<"Ciclu negativ!";
    else
        for (int i=2;i<=n;++i)
            t<<dist[i]<<" ";
    return 0;
}