#include <iostream>
#include <fstream>
#include <vector>
#include <bitset>
#include <queue>

using namespace std;

#define MAX_N 50010
#define INF 0x7FFFFFFF

/**

                                          `-.`'.-'
                                       `-.        .-'.
                                    `-.    -./\.-    .-'
                                        -.  /_|\  .-
                                    `-.   `/____\'   .-'.
                                 `-.    -./.-""-.\.-      '
                                    `-.  /< (()) >\  .-'
                                  -   .`/__`-..-'__\'   .-
                                ,...`-./___|____|___\.-'.,.
                                   ,-'   ,` . . ',   `-,
                                ,-'   ________________  `-,
                                   ,'/____|_____|_____\
                                  / /__|_____|_____|___\
                                 / /|_____|_____|_____|_\
                                ' /____|_____|_____|_____\
                              .' /__|_____|_____|_____|___\
                             ,' /|_____|_____|_____|_____|_\
,,---''--...___...--'''--.. /../____|_____|_____|_____|_____\ ..--```--...___...--``---,,
                           '../__|_____|_____|_____|_____|___\
      \    )              '.:/|_____|_____|_____|_____|_____|_\               (    /
      )\  / )           ,':./____|_____|_____|_____|_____|_____\             ( \  /(
     / / ( (           /:../__|_____|_____|_____|_____|_____|___\             ) ) \ \
    | |   \ \         /.../|_____|_____|_____|_____|_____|_____|_\           / /   | |
 .-.\ \    \ \       '..:/____|_____|_____|_____|_____|_____|_____\         / /    / /.-.
(=  )\ `._.' |       \:./ _  _ ___  ____  ____ _    _ _ _ _ _  _ __\        | `._.' /(  =)
 \ (_)       )        \/                                            \       (       (_) /
  \    `----'          """"""""""""""""""""""""""""""""""""""""""""""        `----'    /
   \   ____\__                                                              __/____   /
    \ (=\     \                                                            /     /-) /
     \_)_\     \                                                         /     /_(_/
          \     \                                                        /     /
           )     )  _                                                _  (     (
          (     (,-' `-..__                                    __..-' `-,)     )
           \_.-''          ``-..____                  ____..-''          ``-._/
            `-._                    ``--...____...--''                    _.-'
                `-.._                                                _..-'
                     `-..__       FORTIS FORTUNA ADIUVAT       __..-'
                           ``-..____                  ____..-''
                                    ``--...____...--''

*/

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=10*n+buffer[index]-'0';
            n^=((n^-n)&-sign);
            return *this;}
        ~parser(){
            input_file.close();}
    private:
        fstream input_file;
        static const int SIZE=0x400000; ///4MB
        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=1;
            if (target<0)
                sign=-1;
            n=target;
            if (n==0)
                nr[aux++]='0';
            for (;n;n/=10)
                nr[aux++]=(sign*n)%10+'0';
            if (sign==-1)
                buffer[index]='-',inc();
            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");

/*
void bellman_ford (int nod){
    queue <int> q;
    bitset <MAX_N> in_queue;
    dist[nod]=0;
    q.push(nod);
    in_queue[nod]=1;
    while (!q.empty() and !cycle){
        int x=q.front();
        q.pop();
        in_queue[x]=0;
        for (auto i:v[x])
            if (dist[x]<INF)
                if (dist[i.first]>dist[x]+i.second) {
                dist[i.first]=dist[x]+i.second;
                if (!in_queue[i.first])
                    if (counter[i.first]>n)
                        cycle=true;
                    else{
                        q.push(i.first);
                        in_queue[i.first]=1;
                         ++counter[i.first];
                    }
            }
    }
}
*/
int main() {
    int n, m;
    bool negative;
    vector <pair <int, int> > graph[MAX_N];
    vector <int> distance(MAX_N);

    auto bellman_ford = [&, distance, graph, n, negative]
    (const unsigned& start) mutable {
        bitset<MAX_N> in_queue(n);
        std::vector<unsigned> relaxations(n);
        std::queue<unsigned> q;

        for (auto& iterator : distance) {
            iterator = INF;
        }

        q.push(start);
        in_queue[start] = true;
        distance[start] = 0;

        while (!q.empty()) {
            auto current = q.front();
            q.pop();
            in_queue[current] = false;

            for (auto iterator : graph[current]) {
                if (distance[current] + iterator.second < distance[iterator.first]) {
                    if (++relaxations[iterator.first] == n) {
                        negative = true;
                        return;
                    }
                    else {
                        if (!in_queue[iterator.second])
                            q.push(iterator.first);
                        distance[iterator.first] = distance[current] + iterator.second;
                    }
                }
            }
        }
    };

    f >> n >> m;
    for (int x, y, c, i = 0; i < m; ++i){
        f >> x >> y >> c;
        graph[x].push_back({y, c});
    }
    bellman_ford(1);
    if (!negative)
        for (int i = 2; i <= n; ++i)
            t << distance[i] << " ";
    else
        t << "Ciclu negativ!";
    return 0;
}