Problem: 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

Solution (in JAVA):

Solution:
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Iterator;
import java.util.List;

// aoj GRL_1_B BellmanFord O(VE)
public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		Printer pr = new Printer(System.out);

		int v = sc.nextInt();
		int e = sc.nextInt();
		int r = sc.nextInt();

		BellmanFord bf = new BellmanFord(v);
		for (int i = 0; i < e; i++) {
			int s = sc.nextInt();
			int t = sc.nextInt();
			int d = sc.nextInt();
			bf.addEdge(s, t, d);
		}

		StringBuilder sb = new StringBuilder();
		for (int i = 0; i < v; i++) {
			long tmp = bf.getShortestPath(r, i);
			if (tmp == -bf.INF) {
//				pr.println("NEGATIVE CYCLE");
				sb = new StringBuilder("NEGATIVE CYCLE\n");
				break;
			} else if (tmp == bf.INF) {
//				pr.println("INF");
				sb.append("INF\n");
			} else {
//				pr.println(tmp);
				sb.append(tmp);
				sb.append("\n");
			}
		}

		pr.print(sb);

		pr.close();
		sc.close();
	}

	private static class BellmanFord {
		long[] d;
		List<Edge> edges;
		int n;
		int s;

		final long INF = Long.MAX_VALUE;

		BellmanFord(int n) {
			this.n = n;
			edges = new ArrayList<Edge>();
			s = -1;
		}

		// i, j:0-indexed
		public void addEdge(int i, int j, int c) {
			edges.add(new Edge(i, j, c));
		}

		// i??????j?????§????????????????????????????????° -INF ?????????
		public long getShortestPath(int i, int j) {
			if (s != i) {
				s = i;

				d = new long[n];
				Arrays.fill(d, INF);
				d[s] = 0;

				boolean update = false;
				for (int kk = 0; kk < n - 1; kk++) {
					update = false;
					for (int jj = 0, size = edges.size(); jj < size; jj++) {
						Edge e = edges.get(jj);
						if (d[e.u] != INF && d[e.v] > d[e.u] + e.w) {
							d[e.v] = d[e.u] + e.w;
							update = true;
						}
					}
					if (!update) {
						break;
					}
				}

				// ?????????????????§??????
				if (update) {
					for (int kk = 0; kk < n; kk++) {
						update = false;
						for (int jj = 0, size = edges.size(); jj < size; jj++) {
							Edge e = edges.get(jj);
							if (d[e.u] == -INF) {
								d[e.v] = -INF;
								update = true;
							} else if (d[e.u] != INF && d[e.v] > d[e.u] + e.w) {
								d[e.v] = -INF;
								update = true;
							}
						}
						if (!update) {
							break;
						}
					}
				}
			}

			return d[j];
		}

		private static class Edge {
			int u; // from
			int v; // to
			int w; // cost

			Edge(int u, int v, int w) {
				this.u = u;
				this.v = v;
				this.w = w;
			}
		}
	}

	@SuppressWarnings("unused")
	private static class Scanner {
		BufferedReader br;
		Iterator<String> it;

		Scanner (InputStream in) {
			br = new BufferedReader(new InputStreamReader(in));
		}

		String next() throws RuntimeException  {
			try {
				if (it == null || !it.hasNext()) {
					it = Arrays.asList(br.readLine().split(" ")).iterator();
				}
				return it.next();
			} catch (IOException e) {
				throw new IllegalStateException();
			}
		}

		int nextInt() throws RuntimeException {
			return Integer.parseInt(next());
		}

		long nextLong() throws RuntimeException {
			return Long.parseLong(next());
		}

		float nextFloat() throws RuntimeException {
			return Float.parseFloat(next());
		}

		double nextDouble() throws RuntimeException {
			return Double.parseDouble(next());
		}

		void close() {
			try {
				br.close();
			} catch (IOException e) {
//				throw new IllegalStateException();
			}
		}
	}

	private static class Printer extends PrintWriter {
		Printer(PrintStream out) {
			super(out);
		}
	}
}