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
import java.io.*;
import java.util.*;

public class Main {
	static int vertex;
	static int edge;
	static int start;
	static int[] cost;
	static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
	static Main obj = new Main();
	static ArrayList<Edge>[] graph;

	private class Edge implements Comparable<Edge> {
		int from;
		int to;
		int weight;

		public Edge(int a, int b, int c) {
			from = a;
			to = b;
			weight = c;
		}

		@Override
		public int compareTo(Edge other) {
			return weight - other.weight;
		}
	}

	public static void main(String[] args) throws IOException {
		input();
		compute(start);

	}

	public static void compute(int a) {
		if (vertex == 0 || edge == 0) {
			System.out.println(0);
			System.exit(0);
		}
		cost[a] = 0;
		ArrayList<Edge> temp = graph[a];
		for (Edge e : temp) {
			if (cost[e.to] > e.weight) {
				cost[e.to] = e.weight;
			}
		}
		boolean changed = true;
		int index = 1;
		while (changed) {
			if (index == vertex) {
				System.out.println("NEGATIVE CYCLE");
				System.exit(0);
			}
			changed = false;
			for (int i = 1; i <= vertex; i++) {
				for (Edge e : graph[i]) {
					if (cost[e.from] != Integer.MAX_VALUE && cost[e.to] > e.weight + cost[e.from]) {
						cost[e.to] = e.weight + cost[e.from];
						changed = true;
					}
				}
			}
			index++;
		}
		for (int i = 1; i < cost.length; i++) {
			if(cost[i]!= Integer.MAX_VALUE){
				System.out.println(cost[i]);
			}else{
				System.out.println("INF");
			}
		}
	}

	@SuppressWarnings("unchecked")
	public static void input() throws IOException {
		StringTokenizer st = new StringTokenizer(br.readLine());
		vertex = Integer.parseInt(st.nextToken());
		edge = Integer.parseInt(st.nextToken());
		start = Integer.parseInt(st.nextToken())+1;
		graph = new ArrayList[vertex + 1];
		cost = new int[vertex + 1];
		for (int i = 1; i <= vertex; i++) {
			graph[i] = new ArrayList<Edge>();
			cost[i] = Integer.MAX_VALUE;
		}
		for (int i = 0; i < edge; i++) {
			st = new StringTokenizer(br.readLine());
			int a = Integer.parseInt(st.nextToken());
			int b = Integer.parseInt(st.nextToken());
			int c = Integer.parseInt(st.nextToken());
			graph[a+1].add(obj.new Edge(a+1, b+1, c));
		}

	}
}