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

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

    private static void solve(Scanner in) {
        int V = in.nextInt(), E = in.nextInt(), r = in.nextInt();
        EdgeWeightedDigraph G = new EdgeWeightedDigraph(V);
        for (int i = 0; i < E; i++) {
            DirectedEdge edge = new DirectedEdge(in.nextInt(), in.nextInt(), in.nextInt());
            G.addEdge(edge);
        }
        SP sp = new SP(G, r);
        for (int i = 0; i < V; i++) {
            System.out.println(sp.hasPathTo(i) ? sp.distTo(i) : "INF");
        }
    }
}

class SP {
    private static final int NA = Integer.MAX_VALUE;

    static class DistTo implements Comparable<DistTo> {
        final int node;
        final int dist;

        DistTo(int node, int dist) {
            this.node = node;
            this.dist = dist;
        }

        @Override
        public int compareTo(DistTo other) {
            return dist - other.dist;
        }
    }

    private final int[] distTo;

    SP(EdgeWeightedDigraph G, int s) {
        distTo = new int[G.V()];
        for (int i = 0; i < G.V(); i++) {
            distTo[i] = i == s ? 0 : NA;
        }
        PriorityQueue<DistTo> pq = new PriorityQueue<>();
        pq.add(new DistTo(s, 0));
        while (!pq.isEmpty()) {
            DistTo poll = pq.poll();// closest node
            if (distTo[poll.node] < poll.dist) {
                continue;
            }
            for (DirectedEdge edge : G.adj(poll.node)) {
                if (distTo[edge.to] > distTo[edge.from] + edge.weight) {
                    distTo[edge.to] = distTo[edge.from] + edge.weight;
                    pq.add(new DistTo(edge.to, distTo[edge.to]));
                }
            }
        }
    }

    int distTo(int t) {
        return distTo[t];
    }

    boolean hasPathTo(int t) {
        return distTo[t] != NA;
    }
}

class EdgeWeightedDigraph {
    private final List<DirectedEdge>[] adj;

    @SuppressWarnings("unchecked")
    EdgeWeightedDigraph(int V) {
        adj = new List[V];
        for (int i = 0; i < V; i++) {
            adj[i] = new ArrayList<DirectedEdge>();
        }
    }

    int V() {
        return adj.length;
    }

    void addEdge(DirectedEdge e) {
        adj[e.from].add(e);
    }

    Iterable<DirectedEdge> adj(int v) {
        return adj[v];
    }
}

class DirectedEdge {
    final int from;
    final int to;
    final int weight;

    DirectedEdge(int from, int to, int weigth) {
        this.from = from;
        this.to = to;
        this.weight = weigth;
    }

    public String toString() {
        return from + "->" + to + " " + String.format("%d", weight);
    }
}