Problem: Little girl Susie accidentally found her elder brother's notebook. She has many things to do, more important than solving problems, but she found this problem too interesting, so she wanted to know its solution and decided to ask you about it. So, the problem statement is as follows.

Let's assume that we are given a connected weighted undirected graph G = (V, E) (here V is the set of vertices, E is the set of edges). The shortest-path tree from vertex u is such graph G1 = (V, E1) that is a tree with the set of edges E1 that is the subset of the set of edges of the initial graph E, and the lengths of the shortest paths from u to any vertex to G and to G1 are the same. 

You are given a connected weighted undirected graph G and vertex u. Your task is to find the shortest-path tree of the given graph from vertex u, the total weight of whose edges is minimum possible.

Input

The first line contains two numbers, n and m (1 ≤ n ≤ 3·105, 0 ≤ m ≤ 3·105) — the number of vertices and edges of the graph, respectively.

Next m lines contain three integers each, representing an edge — ui, vi, wi — the numbers of vertices connected by an edge and the weight of the edge (ui ≠ vi, 1 ≤ wi ≤ 109). It is guaranteed that graph is connected and that there is no more than one edge between any pair of vertices.

The last line of the input contains integer u (1 ≤ u ≤ n) — the number of the start vertex.

Output

In the first line print the minimum total weight of the edges of the tree.

In the next line print the indices of the edges that are included in the tree, separated by spaces. The edges are numbered starting from 1 in the order they follow in the input. You may print the numbers of the edges in any order.

If there are multiple answers, print any of them.

Examples

Input

3 3
1 2 1
2 3 1
1 3 2
3


Output

2
1 2 


Input

4 4
1 2 1
2 3 1
3 4 1
4 1 2
4


Output

4
2 3 4 

Note

In the first sample there are two possible shortest path trees:

  * with edges 1 – 3 and 2 – 3 (the total weight is 3); 
  * with edges 1 – 2 and 2 – 3 (the total weight is 2); 



And, for example, a tree with edges 1 – 2 and 1 – 3 won't be a shortest path tree for vertex 3, because the distance from vertex 3 to vertex 2 in this tree equals 3, and in the original graph it is 1.

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.Deque;
import java.util.PriorityQueue;
import java.util.StringTokenizer;
    
public class Main{

static final InputStream in=System.in;
static final PrintWriter out=new PrintWriter(System.out);
static final long INF=Long.MAX_VALUE/2;

public static class Edge{
int to;
long cost;
int index;
public Edge(int to,long cost,int index){
this.to=to; this.cost=cost; this.index=index;
}
}
    
public static class Pair{
long x;
int y;
public Pair(long x,int y){
this.x=x; this.y=y;
}
public static final Comparator<Pair> DISTANCE_ORDER=new Comp();
private static class Comp implements Comparator<Pair>{
public int compare(Pair p1,Pair p2){
return (p1.x>p2.x)?1:(p1.x<p2.x)?-1:0;
}
}
}
    
public static class MyArrayList extends ArrayList<Edge>{}
    
public static void main(String[] args) throws IOException{
BufferedReader br=new BufferedReader(new InputStreamReader(in));
StringTokenizer st;
StringBuilder sb;
String line="";
while((line=br.readLine())!=null&&!line.isEmpty()){
st=new StringTokenizer(line);
sb=new StringBuilder();
long ans=0;
int n=Integer.parseInt(st.nextToken());
int m=Integer.parseInt(st.nextToken());
long[] dist=new long[n];
int[] prev=new int[n];
long[] minCost=new long[n];
boolean[] used=new boolean[m];
MyArrayList[] array=new MyArrayList[n];
for(int i=0;i<n;i++) array[i]=new MyArrayList();
if(n==0||m==0){
out.println(0); break;
}
for(int i=0;i<m;i++){
st=new StringTokenizer(br.readLine());
int a=Integer.parseInt(st.nextToken())-1;
int b=Integer.parseInt(st.nextToken())-1;
long c=Long.parseLong(st.nextToken());
array[a].add(new Edge(b,c,i+1));
array[b].add(new Edge(a,c,i+1));
}
int s=Integer.parseInt(br.readLine())-1;
dijkstra(s,dist,prev,minCost,array);
lo: for(int i=0;i<n;i++){
if(prev[i]!=-1){
ArrayList<Edge> list=array[i];
for(int j=0;j<list.size();j++){
Edge e=list.get(j);
if(e.to==prev[i]&&!used[e.index-1]){
used[e.index-1]=true;
ans+=e.cost;
sb.append(e.index+" ");
continue lo;
}
}
}
}
sb.deleteCharAt(sb.length()-1);
out.println(ans);
out.println(sb);
}
out.flush();
}
    
public static void dijkstra(int s,long[] dist,int[] prev,long[] minCost,MyArrayList[] array){
PriorityQueue<Pair> pque=new PriorityQueue<Pair>(1,Pair.DISTANCE_ORDER);
Arrays.fill(dist,INF);
Arrays.fill(prev,-1);
Arrays.fill(minCost,INF);
dist[s]=0;
pque.offer(new Pair(0,s));
while(!pque.isEmpty()){
Pair p=pque.poll();
int v=p.y;
ArrayList<Edge> list=array[v];
if(dist[v]<p.x||list.size()==0) continue;
for(int i=0;i<list.size();i++){
Edge e=list.get(i);
if(dist[e.to]>dist[v]+e.cost){
dist[e.to]=dist[v]+e.cost;
prev[e.to]=v;
pque.offer(new Pair(dist[e.to],e.to));
}
else if(dist[e.to]==dist[v]+e.cost){
if(minCost[e.to]>e.cost){
minCost[e.to]=e.cost;
prev[e.to]=v;
}
}
}
}
}
}