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<iostream>
#include<queue>
#include<functional>
#include<algorithm>
#include<vector>
using namespace std;

typedef pair<long long, int>P;

#define MAX_N 150000
#define INF 100000000000000
priority_queue<P, vector<P>, greater<P>>Q;
vector<pair<int, long long>>X[MAX_N];
int N, M, A, B, C, O;
long long dist[MAX_N];
void dijkstra() {
	for (int i = 0; i < MAX_N; i++) {
		dist[i] = INF;
	}
	Q.push(make_pair(0, O)); dist[O] = 0;
	int cnt = 0;
	while (!Q.empty()) {
		cnt++;
		if (cnt >= 8000000 || Q.size() >= 2000000) { cout << "NEGATIVE CYCLE" << endl; return; }
		P pa = Q.top(); Q.pop();
		long long a1 = pa.first; int a2 = pa.second;
		for (int i = 0; i < X[a2].size(); i++) {
			int to = X[a2][i].first;
			if (dist[to] > a1 + X[a2][i].second) {
				dist[to] = a1 + X[a2][i].second;
				Q.push(make_pair(dist[to], to));
			}
		}
	}
	for (int i = 0; i < N; i++) {
		if (dist[i] == INF) { cout << "INF" << endl; }
		else { cout << dist[i] << endl; }
	}
	return;
}
int main() {
	cin >> N >> M >> O;
	for (int i = 0; i < M; i++) {
		cin >> A >> B >> C;
		X[A].push_back(make_pair(B, C));
	}
	dijkstra();
	return 0;
}