#include <bits/stdc++.h>
#define endl '\n'
#define int long long
#define lint long long
#define pii pair<int,int>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define SZ(v) ((int)v.size())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
#define MINF(a) memset(a,0x3f,sizeof(a))
#define POW(n) (1LL<<(n))
#define POPCNT(n) (__builtin_popcount(n))
#define IN(i,a,b) (a <= i && i <= b)
using namespace std;
template <typename T> inline bool CHMIN(T& a,T b) { if(a>b) { a=b; return 1; } return 0; }
template <typename T> inline bool CHMAX(T& a,T b) { if(a<b) { a=b; return 1; } return 0; }
template <typename T> inline void SORT(T& a) { sort(ALL(a)); }
template <typename T> inline void REV(T& a) { reverse(ALL(a)); }
template <typename T> inline void UNI(T& a) { sort(ALL(a)); a.erase(unique(ALL(a)),a.end()); }
template <typename T> inline T LB(vector<T>& v, T a) { return *lower_bound(ALL(v),a); }
template <typename T> inline int LBP(vector<T>& v, T a) { return lower_bound(ALL(v),a) - v.begin(); }
template <typename T> inline T UB(vector<T>& v, T a) { return *upper_bound(ALL(v),a); }
template <typename T> inline int UBP(vector<T>& v, T a) { return upper_bound(ALL(v),a) - v.begin(); }
template <typename T1, typename T2> ostream& operator<< (ostream& os, const pair<T1,T2>& p) { os << p.first << " " << p.second; return os; }
template <typename T1, typename T2> istream& operator>> (istream& is, pair<T1,T2>& p) { is >> p.first >> p.second; return is; }
template <typename T> ostream& operator<< (ostream& os, const vector<T>& v) { REP(i,v.size()) { if (i) os << " "; os << v[i]; } return os; }
template <typename T> istream& operator>> (istream& is, vector<T>& v) { for(T& in : v) is >> in; return is; }
template <typename T = int> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...)); }
template <typename T, typename V> typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) { t = v; }
template <typename T, typename V> typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) { for(auto &e : t) fill_v(e,v); }
const lint MOD = 1000000007;
const lint INF = 0x3f3f3f3f3f3f3f3f;
const double EPS = 1e-10;

template <typename T>
struct Edge {
    int s, t;
    T c;
    Edge() {}
    Edge(int t, T c) : s(-1), t(t), c(c) {}
    Edge(int s, int t, T c) : s(s), t(t), c(c) {}
};

// const long long INF = 0x3f3f3f3f3f3f3f3f;
template <typename T> using Edges = vector<Edge<T>>;
template <typename T> using WeightedGraph = vector<Edges<T>>;
using UnWeightedGraph = vector<vector<int>>;
template <typename T> using Matrix = vector<vector<T>>;

template <typename T = int>
vector<T> SPFA(WeightedGraph<T> &g, int s, T INF = numeric_limits<T>::max()) {
    const int n = g.size();
    T sum = 0;
    int cnt = 0;
    vector<T> dis(n, INF);
    vector<bool> inDeq(n, false);
    vector<int> times(n, 0);
    deque<int> deq;

    dis[s] = 0;
    deq.push_back(s);
    times[s] = 1;
    inDeq[s] = true;
    cnt = 1;
    while (!deq.empty()) {
        const int u = deq.front();
        deq.pop_front();
        inDeq[u] = false;
        sum -= dis[u];
        cnt--;
        for (auto &e : g[u]) {
            const int v = e.t;
            if (dis[v] > dis[u] + e.c) {
                dis[v] = dis[u] + e.c;
                if (!inDeq[v]) {
                    if (++times[v] >= n)
                        return vector<T>();
                    deq.push_back(v);
                    inDeq[v] = true;
                    sum += dis[v];
                    cnt++;

                    // Small Label First (SLF)
                    if (deq.back() < deq.front()) {
                        const int w = deq.back();
                        deq.pop_back();
                        deq.push_front(w);
                    }

                    // Large Label Last (LLL)
                    while (cnt * dis[deq.front()] > sum) {
                        const int w = deq.front();
                        deq.pop_front();
                        deq.push_back(w);
                    }
                }

            }
        }
    }
    return dis;
}

void _main() {
    int V, E, r;
    cin >> V >> E >> r;
    WeightedGraph<int> g(V);
    for (int i = 0; i < E; ++i) {
        int s, t, d;
        cin >> s >> t >> d;
        g[s].emplace_back(t, d);
    }
    auto dis = SPFA(g, r, INF);
    if (dis.empty()) {
        cout << "NEGATIVE CYCLE" << endl;
    } else {
        for (int i = 0; i < V; ++i) {
            if (dis[i] == INF) cout << "INF" << endl;
            else cout << dis[i] << endl;
        }
    }
}

signed main(signed argc, char **argv) {
    if (argc > 1) {
        if (strchr(argv[1], 'i'))
            freopen("input.txt", "r", stdin);
        if (strchr(argv[1], 'o'))
            freopen("output.txt", "w", stdout);
    }
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    _main();
    return 0;
}


Measured memory_bytes: 3240