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

public class B {
    static class Node implements Comparable<Node> {
        long cost, threshold;
        int u;

        public Node(int node, long c) {
            u = node;
            cost = c;
        }

        @Override
        public int compareTo(Node o) {
            return cost < o.cost ? -1 : (cost > o.cost ? 1 : 0);
        }

        @Override
        public String toString() {

            return String.format("Node = %d, Cost = %d", u, cost);
        }
    }

    public static void main(String args[]) throws Exception {
        Reader reader = new Reader();
        reader.initConsoleReading();
        int n = reader.nextInt();
        int m = reader.nextInt();
        List<Pair<Integer, Integer>>[] graph = new List[n + 1];
        int[] weights = new int[m + 1];
        int u, v, w;
        int[] parent = new int[n + 1];
        Arrays.fill(parent, -1);
        for (int i = 1; i <= m; i++) {
            u = reader.nextInt();
            v = reader.nextInt();
            w = reader.nextInt();
            weights[i] = w;
            if (graph[u] == null) graph[u] = new ArrayList<>();
            if (graph[v] == null) graph[v] = new ArrayList<>();
            graph[u].add(new Pair<>(v, i));
            graph[v].add(new Pair<>(u, i));
        }
        int src = reader.nextInt();
        long[] sp = new long[n + 1];
        Arrays.fill(sp, Long.MAX_VALUE);
        sp[src] = 0;
        PriorityQueue<Node> pq = new PriorityQueue<>();
        pq.add(new Node(src, 0));
        long[] min_w = new long[n + 1];
        Arrays.fill(min_w, Long.MAX_VALUE);
        while (!pq.isEmpty()) {
            Node top = pq.poll();
            u = top.u;
            long c = top.cost;
            if (graph[u] != null) {
                for (Pair<Integer, Integer> p : graph[u]) {
                    v = p.first;
                    w = weights[p.second];
                    if (sp[v] > c + w) {
                        sp[v] = c + w;
                        parent[v] = p.second;
                        min_w[v] = w;
                        pq.add(new Node(v, sp[v]));
                    } else if (sp[v] == c + w && min_w[v] > w) {
                        parent[v] = p.second;
                    }
                }
            }
        }
        long totWeight = 0;
        for (int i = 1; i <= n; i++) {
            if (parent[i] != -1) {
                totWeight += weights[parent[i]];
            }
        }
        System.out.println(totWeight);
        for (int i = 1; i <= n; i++) {
            if (parent[i] != -1) {
                System.out.println(parent[i]);
            }
        }
        reader.dispose();

    }

    /************************************Helper Methods Begin Here**********************************************/
    private static String reverse(String toRev) {
        return new StringBuilder(toRev).reverse().toString();
    }

    public static class Pair<F extends Comparable<F>, S extends Comparable<S>> implements Comparable<Pair<F, S>> {
        static final int prime = 31;
        private F first;
        private S second;

        public Pair(F f, S s) {
            this.first = f;
            this.second = s;
        }

        @Override
        public int hashCode() {
            int result = 1;
            result = prime * result + this.first.hashCode();
            result = prime * result + this.second.hashCode();
            return result;
        }

        @Override
        public boolean equals(Object obj) {
            if (this == obj)
                return true;
            if (obj == null)
                return false;
            if (getClass() != obj.getClass())
                return false;
            Pair<F, S> s = (Pair<F, S>) obj;
            return this.first.equals(s.first) && this.second.equals(s.second);
        }

        @Override
        public int compareTo(Pair<F, S> p) {
            int c1 = this.first.compareTo(p.first);
            if (c1 == 0) {
                return this.second.compareTo(p.second);
            }
            return c1;
        }
    }

    public static int swap(int a, int b) {
        /*a = Main.swap(b,b=a); goes from left to right*/
        return a;
    }

    public static long swap(long a, long b) {
        /*a = Main.swap(b,b=a); goes from left to right*/
        return a;
    }

    private static <T1, T2> void init6d(T1[][][][][][] sixD, T2 val) {
        for (T1[][][][][] fiveD : sixD) init5d(fiveD, val);
    }

    private static <T1, T2> void init5d(T1[][][][][] fiveD, T2 val) {
        for (T1[][][][] fourD : fiveD) init4d(fourD, val);
    }

    private static <T1, T2> void init4d(T1[][][][] fourD, T2 val) {
        for (T1[][][] threeD : fourD) init3d(threeD, val);
    }

    private static <T1, T2> void init3d(T1[][][] threeD, T2 val) {
        for (T1[][] twoD : threeD) init2d(twoD, val);
    }

    private static <T1, T2> void init2d(T1[][] twoD, T2 val) {
        for (T1[] oneD : twoD) init1d(oneD, val);
    }

    private static <T1, T2> void init1d(T1[] oneD, T2 val) {
        Arrays.fill(oneD, val);
    }

    public static boolean next_permutation(int[] p) {
        for (int a = p.length - 2; a >= 0; --a)
            if (p[a] < p[a + 1])
                for (int b = p.length - 1; ; --b)
                    if (p[b] > p[a]) {
                        int t = p[a];
                        p[a] = p[b];
                        p[b] = t;
                        for (++a, b = p.length - 1; a < b; ++a, --b) {
                            t = p[a];
                            p[a] = p[b];
                            p[b] = t;
                        }
                        return true;
                    }
        return false;
    }

    public static long gcd(long a, long b) {
        if (a < 0) a *= -1;
        if (b < 0) b *= -1;
        return b == 0 ? a : gcd(b, a % b);
    }

    public static class Reader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public Reader() {
        }

        public Reader initConsoleReading() {
            reader = new BufferedReader(new InputStreamReader(System.in), 32768);
            tokenizer = null;
            return this;
        }

        public Reader initFileReading(String filePath) throws FileNotFoundException {
            reader = new BufferedReader(new FileReader(filePath), 32768);
            tokenizer = null;
            return this;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public String nextLine() throws IOException {
            return reader.readLine();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public long nextLong() {
            return Long.parseLong(next());
        }

        public void dispose() throws IOException {
            this.reader.close();
        }
    }
    /************************************Helper Methods Ends Here**********************************************/
}