// C++ 14
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <algorithm>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <unordered_map>
#include <math.h>

#define ll long long
#define Int ll
#define loop(__x, __start, __end) for(Int __x = __start; __x < __end; __x++)
#define loopdown(__x, __start, __end) for(Int __x = __start; __x > __end; __x--)
#define rep(__n) for(Int __x = 0; __x < __n; __x++)
#define span(__a,__x,__y) __a.begin()+__x,__a.begin()+__y
#define span_all(__a) __a.begin(),__a.end()
#define len(__x) (__x.size())
#define last(__x) (__x[__x.size()-1])

using namespace std;

struct Point {
  Int x, y;
  Point(Int x, Int y): x(x), y(y) {}
  Point(): x(0), y(0) {}

  bool operator< (const Point &p1) {
    return x < p1.x && y < p1.y;
  }
};
ostream & operator << (ostream & out, Point const & v) {
  out << "Point(" << v.x << ", " << v.y << ')';
  return out;
}

istream & operator >> (istream & in, Point & v) {
  Int x, y;
  in >> x; in >> y; v.x = x; v.y = y;
  return in;
}

// Geometry

#define EPS 0.0000000001

class Vector2 {
public:
  double x, y;
  
  Vector2(double x = 0, double y = 0): x(x), y(y) {}
  
  Vector2 operator + (Vector2 v) { return Vector2(x + v.x, y + v.y); }
  Vector2 operator - (Vector2 v) { return Vector2(x - v.x, y - v.y); }
  Vector2 operator * (double k) { return Vector2(x * k, y * k); }
  Vector2 operator / (double k) { return Vector2(x / k, y / k); }
  
  double length() { return sqrt(norm()); }
  double norm() { return x * x + y * y; }
  double dot (Vector2 v) { return x * v.x + y * v.y; }
  double cross (Vector2 v) { return x * v.y - y * v.x; }
  
  bool operator < (const Vector2 &v) const {
    return x != v.x ? x < v.x : y < v.y;
  }
  
  bool operator == (const Vector2 &v) const {
    return fabs(x - v.x) < EPS && fabs(y - v.y) < EPS;
  }
};

ostream & operator << (ostream & out, Vector2 const & v) { 
  out<< "Vector2(" << v.x << ", " << v.y << ')';
  return out;
}

istream & operator >> (istream & in, Vector2 & v) { 
  double x, y;
  in >> x;
  in >> y;
  v.x = x;
  v.y = y;
  return in;
}


class BellmanFord {
public:
  struct Edge {
    long long s, t, w;
    Edge(long long s, long long t, long long w): s(s),t(t),w(w) {}
  };

  const long long INFTY = (1L << 32);
  long long V;
  long long src;
  vector<long long> dist;
  vector<Edge> edges;

  BellmanFord(long long V, long long src): V(V), src(src), dist(V, INFTY) {
    dist.at(src) = 0;
  }

  long long distance(long long t) {
    return dist.at(t);
  }

  void addEdge(long long s, long long t, long long w, bool directed = false) {
    if (directed) {
      edges.push_back(Edge(s, t, w));
      return;
    }

    edges.push_back(Edge(s, t, w));
    edges.push_back(Edge(t, s, w));
  }

  bool sssp() {
    resetDist();

    loop(count,0,V) {
      for (auto edge: edges) {
        if (dist.at(edge.s) == INFTY) continue;
        if (dist.at(edge.t) <= dist.at(edge.s) + edge.w) continue;
        dist.at(edge.t) = dist.at(edge.s) + edge.w;
        if (count == V-1) return true;
      }
    }
    return false;
  }

private:
  void resetDist() {
    loop(x,0,dist.size()) {
      dist.at(x) = INFTY;
    }
    dist.at(src) = 0;
  }
};


#define MAX_V 1001
#define MAX_E 2001
Int V, E, R;
Int S[MAX_E], T[MAX_E], W[MAX_E];


void input() {
  Int s, t, w;
  cin >> V >> E >> R;
  loop(e,0,E) {
    cin >> S[e] >> T[e] >> W[e];
  }
}

void solve() {
  BellmanFord bf(V, R);
  loop(e,0,E) bf.addEdge(S[e], T[e], W[e], true);
  if (bf.sssp()) {
    cout << "NEGATIVE CYCLE" << endl;
    return;
  }

  loop(u,0,V) {
    Int d = bf.distance(u);
    if (d == bf.INFTY) cout << "INF";
    else cout << d;
    cout << endl;
  }
}

int main() {
  input();
  solve();
  return 0;
}



Measured memory_bytes: 3192