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 {

    private static int MOD = 1_000_000_007;

    public static void main(String[] args) {
        final Scanner scanner = new Scanner(System.in);
        solve(scanner);
    }

    static void solve(Scanner scanner) {
        int V = scanner.nextInt();
        int E = scanner.nextInt();
        int R = scanner.nextInt();
        scanner.nextLine();

        Dijkstra dijkstra = new Dijkstra(V);
        for (int i = 0; i < E; i++) {
            int[] e = Arrays.stream(scanner.nextLine().split(" ")).mapToInt(Integer::parseInt).toArray();
            dijkstra.addEdge(e[0], e[1], e[2]);
        }
        dijkstra.run(R);
        for (int i = 0; i < V; i++) {
            if (dijkstra.dist[i] == Long.MAX_VALUE / 2)
                System.out.println("INF");
            else
                System.out.println(dijkstra.dist[i]);
        }
    }


}

class Dijkstra {

    private int size;
    Map<Integer, Set<Edge>> edges;
    public long[] dist;
    public long[] from;

    public Dijkstra(int size) {
        this.size = size;
        dist = new long[size];
        Arrays.fill(dist, Long.MAX_VALUE / 2);
        from = new long[size];
        Arrays.fill(from, -1);
        edges = new HashMap<>();
    }

    public void addEdge(int from, int to, int cost) {
        if (!edges.containsKey(from)) {
            edges.put(from, new HashSet<>());
        }
        edges.get(from).add(new Edge(from, to, cost));
    }

    public void run(int start) {
        Queue<NodeCost> waitingNodes = new PriorityQueue<>(Comparator.comparingInt(x -> x.cost));
        waitingNodes.add(new NodeCost(start, 0));
        dist[start] = 0;
        while (!waitingNodes.isEmpty()) {
            NodeCost nodeCost = waitingNodes.poll();
            if (dist[nodeCost.node] < nodeCost.cost) {
                continue;
            }
            dist[nodeCost.node] = nodeCost.cost;
            for (Edge e : edges.getOrDefault(nodeCost.node, Collections.emptySet())) {
                if (dist[e.to] > dist[nodeCost.node] + e.cost) {
                    dist[e.to] = dist[nodeCost.node] + e.cost;
                    from[e.to] = nodeCost.node;
                    waitingNodes.add(new NodeCost(e.to, nodeCost.cost + e.cost));
                }
            }
        }
    }
}

class Edge {
    public final int from;
    public final int to;
    public final int cost;

    public Edge(int from, int to, int cost) {
        this.from = from;
        this.to = to;
        this.cost = cost;
    }

    @Override
    public boolean equals(Object o) {
        if (this == o) return true;
        if (o == null || getClass() != o.getClass()) return false;
        Edge edge = (Edge) o;
        return from == edge.from &&
                to == edge.to &&
                cost == edge.cost;
    }

    @Override
    public int hashCode() {
        return Objects.hash(from, to, cost);
    }
}

class NodeCost {
    public final int node;
    public final int cost;

    public NodeCost(int node, int cost) {
        this.node = node;
        this.cost = cost;
    }

    @Override
    public boolean equals(Object o) {
        if (this == o) return true;
        if (o == null || getClass() != o.getClass()) return false;
        NodeCost nodeCost = (NodeCost) o;
        return node == nodeCost.node &&
                cost == nodeCost.cost;
    }

    @Override
    public int hashCode() {
        return Objects.hash(node, cost);
    }
}

