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

public class Main {
    int n, m, start;
    ArrayList<ArrayList<Edge>> es;
    public static void main(String[] args) {
        Main m = new Main();
        m.read();
        m.solve();
    }

    private void read() {
        Scanner sc = new Scanner(System.in);
        n = sc.nextInt();
        m = sc.nextInt();
        start = sc.nextInt();
        es = new ArrayList<ArrayList<Edge>>(n);
        for (int i = 0; i < n; i++)
            es.add(new ArrayList<Edge>());
        for (int i = 0; i < m; i++) {
            int f = sc.nextInt();
            int t = sc.nextInt();
            int c = sc.nextInt();
            es.get(f).add(new Edge(f, t, c));
        }
    }

    private void solve() {
        PriorityQueue<Node> queue =
                new PriorityQueue<>(new Comparator<Node>() {
                    @Override
                    public int compare(Node node, Node t1) {
                        return Integer.compare(node.getTotalCost(), t1.getTotalCost());
                    }
                });
        int[] log = new int[n];
            queue.add(new Node(start, 0));
            Arrays.fill(log, Integer.MAX_VALUE);
            while (!queue.isEmpty()) {
                Node n = queue.poll();
                if (n.totalCost >= log[n.current])
                    continue;
                log[n.current] = n.totalCost;
                int tmp;
                    for (Edge e : es.get(n.current)) {
                        tmp = n.totalCost + e.cost;
                        if (tmp < log[e.to])
                            queue.add(new Node(e.to, tmp));
                    }
            }
        for (int ans: log) {
                if (ans == Integer.MAX_VALUE)
                    System.out.println("INF");
                else
                     System.out.println(ans);
        }
    }

     private class Edge {
        int from, to;
        int cost;
        Edge(int f, int t, int c) {
            from = f; to = t; cost = c;
        }
    }

    private class Node {
        int current;
        int totalCost;
        Node (int c, int t) {
            current = c;
            totalCost = t;
        }

        int getTotalCost() {
            return totalCost;
        }
    }
}