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

class Dijkstra {
    private int size;
    private ArrayList<ArrayList<Pair>> adl;

    public Dijkstra (int size) {
        this.size = size;
        adl = new ArrayList<>();
        for (int i = 0; i < size; i++)
            adl.add(new ArrayList<>());
    }

    public void addEdge(int u, int v, int w) {
        adl.get(u).add(new Pair(v, w));
    }

    public ArrayList<Integer> shortestPath(int source) {
        ArrayList<Integer> distance = new ArrayList<Integer>();
        PriorityQueue<Pair> nearest = new PriorityQueue<>((a, b) -> a.w - b.w);
        boolean[] visit = new boolean[this.size];

        for (int i = 0; i < size; i++)
            distance.add(-1);

        nearest.offer(new Pair(source, 0));
        while (nearest.size() > 0) {
            Pair cur = nearest.poll();
            if (visit[cur.v])
                continue;

            visit[cur.v] = true;
            distance.set(cur.v, cur.w);

            for (Pair ng: this.adl.get(cur.v))
                nearest.offer(new Pair(ng.v, cur.w + ng.w));
        }
        return distance;
    }
}

class Pair {
    public int v;
    public int w;

    public Pair(int v, int w) {
        this.v = v;
        this.w = w;
    }

    public Pair() {
        this(0, 0);
    }

    public String toString() {
        return "(" + Integer.toString(v) + ", " + Integer.toString(w) + ")";
    }
}

class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int v = in.nextInt();
        int e = in.nextInt();
        int s = in.nextInt();
        Dijkstra dijkstra = new Dijkstra(v);
        for (int i = 0; i < e; i++) {
            int p = in.nextInt();
            int q = in.nextInt();
            int w = in.nextInt();
            dijkstra.addEdge(p, q, w);
        }

        ArrayList<Integer> distance = dijkstra.shortestPath(s);
        for (Integer d: distance)
            System.out.println(d == -1 ? "INF" : d);
    }
}

