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.InputStreamReader;
import java.util.ArrayList;
import java.util.PriorityQueue;
import java.util.StringTokenizer;

public class Main {
    public static void main(String[] args) {
        ArrayList<Node> nodes = new ArrayList<>();
        PriorityQueue<Node> q = new PriorityQueue<>();
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st;
        try {
            String line;
            line = br.readLine();
            st = new StringTokenizer(line);
            int v = Integer.parseInt(st.nextToken());
            int e = Integer.parseInt(st.nextToken());
            int r = Integer.parseInt(st.nextToken());
            for (int i = 0; i < v; i++) {
                Node node = new Node();
                if (i == r) {
                    node.confirmed = true;
                    node.minCost = 0;
                    nodes.add(node);
                } else {
                    nodes.add(node);
                }
            }
            for (int i = 0; i < e; i++) {
                line = br.readLine();
                st = new StringTokenizer(line);
                int s = Integer.parseInt(st.nextToken());
                int t = Integer.parseInt(st.nextToken());
                int d = Integer.parseInt(st.nextToken());
                nodes.get(s).addEdge(t, d);
            }
            
            q.add(nodes.get(r));

            while (!q.isEmpty()) {
                Node confirmedNode = q.poll();
                confirmedNode.confirmed = true;
                for (int i = 0; i < confirmedNode.edgeTo.size(); i++) {
                    int to = confirmedNode.edgeTo.get(i);
                    int cost = confirmedNode.minCost + confirmedNode.edgeCost.get(i);
                    if (cost < nodes.get(to).minCost) {
                        nodes.get(to).minCost = cost;
                        if (!q.contains(nodes.get(to))) {
                            q.add(nodes.get(to));
                        }
                    }
                }
            }
            for (Node node : nodes) {
                if (node.minCost == Integer.MAX_VALUE) {
                    System.out.println("INF");
                } else {
                    System.out.println(node.minCost);
                }
            }

        } catch (Exception e) {
            e.printStackTrace();
        }

    }
}

class Node implements Comparable<Node> {
    ArrayList<Integer> edgeTo = new ArrayList<>();
    ArrayList<Integer> edgeCost = new ArrayList<>();
    int minCost;
    boolean confirmed;

    Node() {
        minCost = Integer.MAX_VALUE;
        confirmed = false;
    }
    
    void addEdge(int t, int d) {
        edgeTo.add(t);
        edgeCost.add(d);
    }

    @Override
    public int compareTo(Node that) {
        if (this.minCost < that.minCost) {
            return -1;
        } else if (this.minCost > that.minCost) {
            return 1;
        }
        return 0;
    }
}