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;

int i,j,r,n,m,s,t,d,q;
int inf=1000000000;

vector<vector<pair<int,int> > > L(1000,vector<pair<int,int> >(0));
vector<int> x(1000,0),y(1000,inf),p(1000,-1);
queue<int> Q;


void scan(int v){
	
	if(y[v]==inf) return;
	for(j=0; j<L[v].size(); j++){
		if(y[v]+L[v][j].second<y[L[v][j].first]){
			p[L[v][j].first]=v;
			y[L[v][j].first]=y[v]+L[v][j].second;
			if(x[L[v][j].first]==0){
				Q.push(L[v][j].first);
				x[L[v][j].first]=1;
			}
		}
	}
	return ;
	
}
int main() {
	
	cin >> n >> m >> r;
	
	y[r]=0;
	for(j=0; j<m; j++){
		cin >> s >> t >> d;
		L[s].push_back({t,d});
	}
	
	Q.push(r);
	Q.push(-1);
	x[r]=1;
	
	i=0;
	while(i<n){
		q=Q.front();
		Q.pop();
		if(q==-1){
			i++;
			Q.push(-1);
		}else{
			x[q]=0;
			scan(q);
		}
	}
	
	for(i=0; i<n; i++){
		for(j=0; j<L[i].size(); j++){
			if(y[i]<inf && y[i]+L[i][j].second<y[L[i][j].first]){
				cout << "NEGATIVE CYCLE" << endl;
				return 0;
			}
		}
	}
	
	for(j=0; j<n; j++){
		if(y[j]==inf){
			cout << "INF" << endl;
		}else{
			cout << y[j] << endl;
		}
	}

	
	return 0;
}
