For a given weighted graph G(V, E) and a source r, find the source shortest path to each vertex from the source (SSSP: Single Source Shortest Path).

Constraints

* 1 ≤ |V| ≤ 100000
* 0 ≤ di ≤ 10000
* 0 ≤ |E| ≤ 500000
* 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

Print the costs of SSSP in the following format.


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 1
0 2 4
1 2 2
2 3 1
1 3 5


Output

0
1
3
4


Input

4 6 1
0 1 1
0 2 4
2 0 1
1 2 2
3 1 1
3 2 5


Output

3
0
2
INF
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.PriorityQueue;
import java.util.StringTokenizer;

class Main {
	public static void main(String[] args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		Task solver = new Task();
		solver.solve(in, out);
		out.close();
	}

	static class Task {
		int V, E, r;

		void solve(InputReader in, PrintWriter out) {
			V = in.nextInt();
			E = in.nextInt();
			r = in.nextInt();
			
			Dijkstra dks = new Dijkstra(V);
			
			for (int i = 0; i < E; ++i) {
				int u = in.nextInt();
				int v = in.nextInt();
				int w = in.nextInt();
				dks.addEdge(u, v, w);
			}

			dks.setDistances(r);

			for (int i = 0; i < V; ++i) {
				int d = dks.getDistance(i);
				out.println(d < 0 ? "INF" : d);
			}
		}
	}

	static class Dijkstra {
		private static int INF = Integer.MAX_VALUE;

		private int[] dst;
		private boolean[] done;
		private List<List<int[]>> nodes;
		private PriorityQueue<int[]> vertexQ;

		public Dijkstra(int n) {
			this.dst = new int[n];
			this.done = new boolean[n];
			this.nodes = new ArrayList<>();
			for (int i = 0; i < n; ++i) {
				nodes.add(new ArrayList<>());
			}
			this.vertexQ = new PriorityQueue<>((u, v) -> u[1] - v[1]);
		}

		private void init() {
			Arrays.fill(dst, INF);
			Arrays.fill(done, false);
			vertexQ.clear();
		}

		public int getDistance(int node) {
			return dst[node] < INF ? dst[node] : -1;
		}

		public void setDistances(int sp) {
			init();

			dst[sp] = 0;
			vertexQ.add(new int[] { sp, dst[sp] });

			while (!vertexQ.isEmpty()) {
				int[] cur = vertexQ.poll();
				int u = cur[0];
				done[u] = true;

				if (dst[u] < cur[1])
					continue;

				for (int[] node : nodes.get(u)) {
					int v = node[0];
					if (done[v])
						continue;
					if (dst[v] > dst[u] + node[1]) {
						dst[v] = dst[u] + node[1];
						vertexQ.add(new int[] { v, dst[v] });
					}
				}
			}
		}

		public void addEdge(int u, int v, int l) {
			nodes.get(u).add(new int[] { v, l });
		}
	}

	static class InputReader {
		static int BUFSIZE = 32768;

		BufferedReader reader;
		StringTokenizer tokenizer;

		InputReader(InputStream stream) {
			reader = new BufferedReader(new InputStreamReader(stream), BUFSIZE);
			tokenizer = null;
		}

		String next() {
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					tokenizer = new StringTokenizer(reader.readLine());
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
			}
			return tokenizer.nextToken();
		}

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

		int[] nextIntArray(int n) {
			int[] arr = new int[n];
			for (int i = 0; i < n; ++i) {
				arr[i] = nextInt();
			}
			return arr;
		}

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

		long[] nextLongArray(int n) {
			long[] arr = new long[n];
			for (int i = 0; i < n; ++i) {
				arr[i] = nextLong();
			}
			return arr;
		}
	}
}

