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 dhoom ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);  
typedef long long ll;
typedef pair<ll,ll> pll;
const ll inf = 99999999999;
const int nax = 2e6 + 7;
int n , m;
vector< pair< ll , pair< ll , ll > >  > edges;
int main(){
	dhoom;
	int v , e , s;
	cin >> v >> e >> s;
	for(int i = 0 ; i < e ; i++){
			int u , x , w;
			cin >> u >> x >> w;
			edges.push_back({u , {x, w}});
	}
	ll dis[v];
	for(int i = 0 ; i < v ; i++)
		dis[i] = inf;
	dis[s] = 0;
	for(int i = 0 ; i < v - 1; i++){
		for(int j = 0 ; j < e ; j++){
			ll x = edges[j].first;
			ll y = edges[j].second.first;
			ll wt = edges[j].second.second;
			if(dis[x] < inf)
				dis[y] = min(dis[y] , dis[x] + wt);
		}
	}
	for(int j = 0 ; j < e ; j++){
		ll x = edges[j].first;
		ll y = edges[j].second.first;
		ll wt = edges[j].second.second;
		if(dis[x]!= inf && dis[x] + wt < dis[y])
			return cout << "NEGATIVE CYCLE\n",0;
	}
	for(int i = 0 ; i < v ;i++){
		if(dis[i] == inf)
				cout << "INF" << endl;
	    else 
				cout << dis[i] << endl;
		
	}
    return 0;
}


