Constraints

* 1 ≤ |V| ≤ 1000
* 0 ≤ |E| ≤ 2000
* -10000 ≤ di ≤ 10000
* There are no parallel edges
* There are no self-loops

Input

An edge-weighted graph G (V, E) and the source r.


|V| |E| r
s0 t0 d0
s1 t1 d1
:
s|E|-1 t|E|-1 d|E|-1


|V| is the number of vertices and |E| is the number of edges in G. The graph vertices are named with the numbers 0, 1,..., |V|-1 respectively. r is the source of the graph.

si and ti represent source and target vertices of i-th edge (directed) and di represents the cost of the i-th edge.

Output

If the graph contains a negative cycle (a cycle whose sum of edge costs is a negative value) which is reachable from the source r, print


NEGATIVE CYCLE


in a line.

Otherwise, print


c0
c1
:
c|V|-1


The output consists of |V| lines. Print the cost of the shortest path from the source r to each vertex 0, 1, ... |V|-1 in order. If there is no path from the source to a vertex, print "INF".

Examples

Input

4 5 0
0 1 2
0 2 3
1 2 -5
1 3 1
2 3 2


Output

0
2
-3
-1


Input

4 6 0
0 1 2
0 2 3
1 2 -5
1 3 1
2 3 2
3 1 0


Output

NEGATIVE CYCLE


Input

4 5 1
0 1 2
0 2 3
1 2 -5
1 3 1
2 3 2


Output

INF
0
-5
-3
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef long long int ll;
typedef pair<int, int> P;

const int MAX_N = 2000;
const ll INF = 1LL<<60;

int n, m, s, t;
bool nc;
vector<pair<P, ll>> G;
vector<ll> dist(MAX_N, INF);

void init()
{
  cin >> n >> m >> s;
  rep(i,m)
  {
    int a, b;
    ll c;
    cin >> a >> b >> c;
    G.emplace_back(pair<P, ll>(P(a, b), c));
  }
  nc = false;
  
  return;
}

void bf()
{
  dist[s] = 0;
  int cnt = 0;
  while(true)
  {
    if(cnt > n)
    {
      nc = true;
      break;
    }
    
    bool flg = false;
    rep(i,G.size())
    {
      int from = G[i].first.first, to = G[i].first.second, cost = G[i].second;
      if(dist[from] >= INF) continue;
      if(dist[from] + cost < dist[to])
      {
        dist[to] = dist[from] + cost;
        flg = true;
      }
    }
    if(flg == false) break;
    cnt++;
  }
  
  return;
}

void put()
{
  if(nc) cout << "NEGATIVE CYCLE" << endl;
  else rep(i,n) cout << ((dist[i] == INF)? "INF" : to_string(dist[i])) << "\n";
  return;
}

int main()
{
  init();
  bf();
  put();
  return 0;
}
