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.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.PriorityQueue;
import java.util.Scanner;


@SuppressWarnings("unchecked")
class Dijkstra{
    class Edge{
        int to,cost;
        Edge(int to,int cost){this.to=to;this.cost=cost;}
    }
    class Node{
        int v,dis;
        Node(int v,int dis){this.v=v;this.dis=dis;}
    }
    List<Edge> edges[];
    int[] d;
    void add_edge(int from,int to,int cost){
        edges[from].add(new Edge(to,cost));
    }
    Dijkstra(int N){
        edges = new ArrayList[N];
        d = new int[N];
        for(int i=0;i<N;++i)edges[i]=new ArrayList<>();
    }
    Dijkstra(int N,int[] from, int[] to,int[] cost){
        edges = new ArrayList[N];
        d = new int[N];
        for(int i=0;i<N;++i)edges[i]=new ArrayList<>();
        for(int i=0;i<from.length;++i)edges[from[i]].add(new Edge(to[i],cost[i]));
    }

    int shortest(int s,int t){
        Arrays.fill(d, Integer.MAX_VALUE);
        d[s]=0;
        PriorityQueue<Node> que = new PriorityQueue<>((a,b)->a.dis-b.dis);
        que.add(new Node(s,0));
        while(!que.isEmpty()){
            Node node = que.poll();
            if(node.dis > d[node.v])continue;
            for(Edge e : edges[node.v]){
                if(d[e.to]<=d[node.v]+e.cost)continue;
                d[e.to]=d[node.v]+e.cost;
                que.add(new Node(e.to, d[e.to]));
            }
        }
        return d[t];
    }



    // AIZU ONLINE JUDGE
    // 単一始点最短経路
    public static void main(String[] args){
        Scanner scan = new Scanner(System.in);
        int V = scan.nextInt();
        int E = scan.nextInt();
        int s = scan.nextInt();
        int[] from = new int[E];
        int[] to = new int[E];
        int[] c = new int[E];
        for(int i=0;i<E;++i){
            from[i]=scan.nextInt();
            to[i]=scan.nextInt();
            c[i]=scan.nextInt();
        }
        Dijkstra dijkstra = new Dijkstra(V, from, to, c);
        dijkstra.shortest(s, 0);
        for(int i=0;i<V;++i)System.out.println((dijkstra.d[i]<Integer.MAX_VALUE ? String.valueOf(dijkstra.d[i]):"INF"));
    }

}

class Main{
    public static void main(String[] args){
        Scanner scan = new Scanner(System.in);
        int V = scan.nextInt();
        int E = scan.nextInt();
        int s = scan.nextInt();
        int[] from = new int[E];
        int[] to = new int[E];
        int[] c = new int[E];
        for(int i=0;i<E;++i){
            from[i]=scan.nextInt();
            to[i]=scan.nextInt();
            c[i]=scan.nextInt();
        }
        Dijkstra dijkstra = new Dijkstra(V, from, to, c);
        dijkstra.shortest(s, 0);
        for(int i=0;i<V;++i)System.out.println((dijkstra.d[i]<Integer.MAX_VALUE ? String.valueOf(dijkstra.d[i]):"INF"));
    }
}
