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 ProblemC{
  long[] d = null;//sからの最短経路
  ArrayList<ArrayList<Edge>> g = new ArrayList<ArrayList<Edge>>();
  long inf = 1000000000;

  void solve(){
    Scanner scan = new Scanner(System.in);
    int v = scan.nextInt();
    int e = scan.nextInt();
    int r = scan.nextInt();

    d = new long[v];

    for(int i=0 ; i<v ; ++i){
      g.add(new ArrayList<Edge>());
    }

    for(int i=0 ; i<e ; ++i){
      int s = scan.nextInt();
      int t = scan.nextInt();
      int d = scan.nextInt();
      g.get(s).add(new Edge(t, d));
    }

    dijkstra(r, v);

    for(int i=0 ; i<d.length ; ++i){
      if(d[i] == inf) System.out.println("INF");
      else System.out.println(d[i]);
    }

  }

  void dijkstra(int r, int vn){
    PriorityQueue<IntPair> que = new PriorityQueue<IntPair>();
    for(int i=0 ; i<vn ; ++i) d[i] = inf;
    d[r] = 0;
    que.add(new IntPair(0, r));
    while(!que.isEmpty()){
      IntPair p = que.poll();//IntPair(Key:頂点番号, Value:最短距離)
      int v = p.value;//頂点番号
      if(d[v] < p.key) continue;
      for(int i=0 ; i<g.get(v).size() ; ++i){

        Edge e = g.get(v).get(i);
        if(d[e.to] > d[v] + e.cost){
          d[e.to] = d[v] + e.cost;
          que.add(new IntPair(d[e.to], (int)e.to));
        }
      }
    }//----end of while----
  }//----end of dijkstra----
}

class IntPair implements Comparable<IntPair>{
  public long key;
  public int value;

  IntPair(long key, int value){
    this.key = key;
    this.value = value;
  }

  public int compareTo(IntPair other){
    if(key < other.key) return -1;
    if(key > other.key) return 1;

    if(value < other.key) return -1;
    if(value > other.key) return 1;

    return 0;
  }
}

class Edge{
  int to = 0;
  int cost = 0;

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


public class Main{
  public static void main(String[] args){
    new ProblemC().solve();
  }
}

