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

Solution (in JAVA):

Solution:
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;

public class Main {
	static int d[];
	static List<edge> edges;

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

		int V = sc.nextInt(); //頂点の数
		int E = sc.nextInt(); //辺の数
		int r = sc.nextInt(); //始点の番号

		d = new int[V];
		edges = new ArrayList<>();

		for(int i = 0; i < E; i++){
			int start = sc.nextInt();
			int end = sc.nextInt();
			int cost = sc.nextInt();

			edges.add(new edge(start, end, cost));
		}

		execDijkstra(r);

		for(int i=0; i<d.length; i++){
			if(d[i] == Integer.MAX_VALUE/2){
				System.out.println("INF");
			}else {
				System.out.println(d[i]);
			}
		}
	}

	static void execDijkstra(int now){
		Arrays.fill(d, Integer.MAX_VALUE/2);
		d[now] =0;

		while(true){
			boolean judge =false;
			for(edge e: edges){
				if(d[e.to]> d[e.from] + e.cost){
					d[e.to] = d[e.from] + e.cost;
					judge = true;
				}
			}
			if(!judge){
				break;
			}
		}
	}

	static class edge{
		int from;
		int to;
		int cost;

		public edge(int a, int b, int c) {
			this.from =a;
			this.to = b;
			this.cost = c;
		}
	}
}