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.*;import java.io.*;import java.math.*;
public class Main{
  //↓見なくていいよ！ここから------------------------------------------
  static class InputIterator{
    ArrayList<String> inputLine = new ArrayList<String>(1024);
    int index = 0; int max;
    InputIterator(){
      BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
      while(true){
        String read;
        try{
          read = br.readLine();
        }catch(IOException e){
          read = null;
        }
        if(read != null){
          inputLine.add(read);
        }else{
          break;
        }
      }
      max = inputLine.size();
    }
    boolean hasNext(){return (index < max);}
    String next(){
      if(hasNext()){
        String returnStr = inputLine.get(index);
        index++;
        return returnStr;
      }else{
        throw new IndexOutOfBoundsException("これ以上入力はないよ");
      }
    }
  }
  
  static InputIterator ii = new InputIterator();//リアクティブでは使えないので諦めてScanner使うこと
  static PrintWriter out = new PrintWriter(System.out);
  static void flush(){out.flush();}
  static void myout(Object t){out.println(t);}
  static void myerr(Object t){System.err.println(t);}
  static String next(){return ii.next();}
  static int nextInt(){return Integer.parseInt(next());}
  static long nextLong(){return Long.parseLong(next());}
  static ArrayList<String> nextStrArray(){return myHanSpSplit(next());}
  static ArrayList<String> myHanSpSplit(String str){return new ArrayList<String>(Arrays.asList(str.split(" ")));}
  static ArrayList<String> nextCharArray(){return mySingleSplit(next());}
  static ArrayList<String> mySingleSplit(String str){return new ArrayList<String>(Arrays.asList(str.split("")));}
  static ArrayList<Integer> nextIntArray(){
    ArrayList<Integer> ret = new ArrayList<Integer>();
    ArrayList<String> input = nextStrArray();
    for(int i = 0; i < input.size(); i++){
      ret.add(Integer.parseInt(input.get(i)));
    }
    return ret;
  }
  static ArrayList<Long> nextLongArray(){
    ArrayList<Long> ret = new ArrayList<Long>();
    ArrayList<String> input = nextStrArray();
    for(int i = 0; i < input.size(); i++){
      ret.add(Long.parseLong(input.get(i)));
    }
    return ret;
  }
  static String kaigyoToStr(String[] list){return String.join("\n",list);}
  static String kaigyoToStr(ArrayList<String> list){return String.join("\n",list);}
  static String hanSpToStr(String[] list){return String.join(" ",list);}
  static String hanSpToStr(ArrayList<String> list){return String.join(" ",list);}
  public static void main(String[] args){
    solve();
    flush();
  }
  //↑見なくていいよ！ここまで------------------------------------------
  static void solve(){//ここがメイン関数代わり
    ArrayList<Integer> one = nextIntArray();
    int V = one.get(0);
    int E = one.get(1);
    int S = one.get(2);
    Node[] nodes = new Node[V];
    for(int i = 0; i < V; i++){
      nodes[i] = new Node();
    }
    for(int i = 0; i < E; i++){
      ArrayList<Integer> tmp = nextIntArray();
      nodes[tmp.get(0)].dist.put(tmp.get(1), tmp.get(2));
      //nodes[tmp.get(1)].dist.put(tmp.get(0), tmp.get(2));
    }
    nodes[S].cost = 0;
    PriorityQueue<QueueObject> pq = new PriorityQueue<QueueObject>(new originComparator());
    QueueObject first = new QueueObject(S, 0);
    pq.add(first);
    while(pq.size() > 0){
      QueueObject tmp = pq.poll();
      int now = tmp.no;
      int ruisekiCost = tmp.value;
      Iterator it = nodes[now].dist.keySet().iterator();
      while(it.hasNext()){
        int tonari = (int)it.next();
        if(nodes[tonari].cost == -1){
          nodes[tonari].cost = ruisekiCost + nodes[now].dist.get(tonari);
          QueueObject addObj = new QueueObject(tonari, nodes[tonari].cost);
          pq.add(addObj);
        }else if(nodes[tonari].cost > ruisekiCost + nodes[now].dist.get(tonari)){
          nodes[tonari].cost = ruisekiCost + nodes[now].dist.get(tonari);
          QueueObject addObj = new QueueObject(tonari, nodes[tonari].cost);
          pq.add(addObj);
        }
      }
    }
    for(int i = 0; i < V; i++){
      if(nodes[i].cost == -1){
        myout("INF");
      }else{
        myout(nodes[i].cost);
      }
    }
  }
  //Method addition frame start
static class Node{
  HashMap<Integer, Integer> dist = new HashMap<Integer, Integer>();
  int cost = -1;
  boolean access = false;
  void Node(){}
}

static class QueueObject{
  int no;
  int value;
  QueueObject(int n, int v){
    no = n;
    value = v;
  }
  String out(){
    return "no : " + no + ", value : " + value;
  }
}
  
public static class originComparator implements Comparator<QueueObject>{
  public int compare(QueueObject mae, QueueObject ato){
    return mae.value - ato.value;
  }
}
  //Method addition frame end
}

