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

class Main {
	static final int INF = Integer.MAX_VALUE/2;
	public static final Comparator<Node> COMPARATOR = new Comp();
	
	private static class Comp implements Comparator<Node>{
		public int compare(Node x,Node y){
			if(x.d>y.d){
			return 1;
			}
			else if(x.d<y.d){
			return -1;
			}
			return 0;
		}
	}
	
	static class Node{
		int id;
		int d;
		Node(int id,int d){
			this.id = id;
			this.d = d;
		}
	}
	
	
	static class Edge{
		int to;
		int cost;
		Edge(int to,int cost){
			this.to = to;
			this.cost = cost;
		}
	}
	
	public static void main(String[] args){
		Scanner stdIn = new Scanner(System.in);
		int V = stdIn.nextInt();
		int E = stdIn.nextInt();
		int r = stdIn.nextInt();
		
		ArrayList<ArrayList<Edge>> graph = new ArrayList<ArrayList<Edge>>(); 
		for(int i=0;i<V;i++){
			graph.add(new ArrayList<Edge>());
		}
		
		for(int i=0;i<E;i++){
			int s = stdIn.nextInt();
			int t = stdIn.nextInt();
			int d = stdIn.nextInt();
			Edge edge = new Edge(t,d);
			ArrayList<Edge> list = graph.get(s);
			list.add(edge);
		}
		
		PriorityQueue<Node> queue = new PriorityQueue<Node>(10,COMPARATOR);
		int[] d = new int[V];
		Arrays.fill(d,INF);
		d[r] = 0;
		Node node = new Node(r,0); 
		queue.add(node);
		
		while(!queue.isEmpty()){
			Node x = queue.poll();
			if(d[x.id]<x.d)
				continue;
			ArrayList<Edge> list = graph.get(x.id);
			for(int i=0;i<list.size();i++){
				Edge y = list.get(i);
				if(d[x.id]+y.cost<d[y.to]){
					d[y.to] = d[x.id] + y.cost;
					Node node_ = new Node(y.to,d[y.to]);
					queue.add(node_);
				}
			}
		}
		for(int i=0;i<V;i++){
			if(d[i]==INF){
				System.out.println("INF");
			}
			else{
				System.out.println(d[i]);
			}
		}
	}
}