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.List;
import java.util.PriorityQueue;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;

public class Main {
    int V,E,r;
    List<ArrayList<Edge>> G;
    long[] ans;
 
    private class Edge{
        int n,c;
        public Edge(int n,int c){
            this.n = n;
            this.c = c;
        }
    }
 
    private class Com implements Comparable<Com>{
        int n;
        long c;
        public Com(int n,long c){
            this.n = n;
            this.c = c;
        }
 
        public int compareTo(Com d){
            if(this.c - d.c < 0){
                return -1;
            }else if(this.c - d.c > 0){
                return 1;
            }else{
                return 0;
            }
        }
    }
 
    public void dijkstra(int s){
        boolean[] used = new boolean[V];
 
        PriorityQueue<Com> pq = new PriorityQueue<Com>();
        pq.add(new Com(r,0));
        while(pq.size() > 0){
        	Com d = pq.poll();
 
            used[d.n] = true;
            ans[d.n] = Math.min(ans[d.n],d.c);
 
            for(Edge i : G.get(d.n)){
                if(used[i.n])continue;
                pq.add(new Com(i.n,d.c + i.c));
            }
        }
    }
    public static void main(String[] args) throws IOException {
    	Main m = new Main();
    	int r = m.init();
        m.dijkstra(r);
        m.display();
    }
    public void display(){
    	 for(int i = 0;i < V;i++){
             if(ans[i] == Long.MAX_VALUE)
             	System.out.println("INF");
             else 
             	System.out.println(ans[i]);
         }
    }
    public int init() throws IOException{
    	BufferedReader BR = new BufferedReader(new InputStreamReader(System.in));
		String str = BR.readLine();
		String [] arr = str.split("\\s+");
		V = Integer.parseInt(arr[0]);
		E = Integer.parseInt(arr[1]);
		r = Integer.parseInt(arr[2]);
		G = new ArrayList<ArrayList<Edge>>();
		ans = new long[V];
		for(int i = 0;i < V;i++){
            G.add(new ArrayList<Edge>());
        }
 
        for(int i = 0;i < V;i++){
            ans[i] = Long.MAX_VALUE;
        }
        for(int i = 0;i < E;i++){
            String tempstr = BR.readLine();
			String [] temparr = tempstr.split("\\s+");
            G.get(Integer.parseInt(temparr[0])).add(new Edge(Integer.parseInt(temparr[1]),Integer.parseInt(temparr[2])));
        }
        return r;
    }
    
}