import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.BufferedInputStream;
import java.util.PriorityQueue;
import java.util.ArrayList;
import java.util.AbstractCollection;
import java.io.FilterInputStream;
import java.util.Comparator;
import java.util.Collections;
import java.io.InputStream;

/**
 * @author khokharnikunj8
 */

public class Main {
    public static void main(String[] args) {
        new Thread(null, new Runnable() {
            public void run() {
                new Main().solve();
            }
        }, "1", 1 << 26).start();
    }

    void solve() {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        ScanReader in = new ScanReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        ProblemDResourceDistribution solver = new ProblemDResourceDistribution();
        solver.solve(1, in, out);
        out.close();
    }

    static class ProblemDResourceDistribution {
        public void solve(int testNumber, ScanReader in, PrintWriter out) {
            int n = in.scanInt();
            int x1 = in.scanInt();
            int x2 = in.scanInt();
            PriorityQueue<pair> priorityQueue = new PriorityQueue<>();
            PriorityQueue<pair> priorityQueue1 = new PriorityQueue<>();
            ArrayList<pair> arrayList1 = new ArrayList<>();
            ArrayList<pair> arrayList2 = new ArrayList<>();
            boolean flag = true;
            for (int i = 0; i < n; i++) {
                int temp = in.scanInt();
                priorityQueue.add(new pair(i + 1, temp));
                priorityQueue1.add(new pair(i + 1, temp));
            }
            while (!priorityQueue.isEmpty()) {
                arrayList1.add(priorityQueue.poll());
                if ((double) x1 / arrayList1.size() <= arrayList1.get(arrayList1.size() - 1).value) {
                    break;
                }
            }
            while (!priorityQueue.isEmpty()) {
                arrayList2.add(priorityQueue.poll());
                if ((double) x2 / arrayList2.size() <= arrayList2.get(arrayList2.size() - 1).value) {
                    break;
                }
            }

            if (arrayList1.size() == 0 || arrayList2.size() == 0) flag = false;

            if (flag && (double) x1 / arrayList1.size() <= arrayList1.get(arrayList1.size() - 1).value && (double) x2 / arrayList2.size() <= arrayList2.get(arrayList2.size() - 1).value) {
                out.println("Yes");
                out.print(arrayList1.size() + " " + arrayList2.size());
                out.println();
                Collections.sort(arrayList1, new Comparator<pair>() {

                    public int compare(pair o1, pair o2) {
                        return o1.index - o2.index;
                    }
                });
                Collections.sort(arrayList2, new Comparator<pair>() {

                    public int compare(pair o1, pair o2) {
                        return o1.index - o2.index;
                    }
                });
                for (pair i : arrayList1) out.print(i.index + " ");
                out.println();
                for (pair i : arrayList2) out.print(i.index + " ");
                out.println();

            } else flag = false;

            if (!flag) {
                arrayList1 = new ArrayList<>();
                arrayList2 = new ArrayList<>();
                while (!priorityQueue1.isEmpty()) {
                    arrayList1.add(priorityQueue1.poll());
                    if ((double) x2 / arrayList1.size() <= arrayList1.get(arrayList1.size() - 1).value) {
                        break;
                    }
                }
                while (!priorityQueue1.isEmpty()) {
                    arrayList2.add(priorityQueue1.poll());
                    if ((double) x1 / arrayList2.size() <= arrayList2.get(arrayList2.size() - 1).value) {
                        break;
                    }
                }
                if (arrayList1.size() == 0 || arrayList2.size() == 0) {
                    out.println("No");
                    return;
                }


                if ((double) x2 / arrayList1.size() <= arrayList1.get(arrayList1.size() - 1).value && (double) x1 / arrayList2.size() <= arrayList2.get(arrayList2.size() - 1).value) {
                    out.println("Yes");
                    out.print(arrayList1.size() + " " + arrayList2.size());
                    out.println();
                    Collections.sort(arrayList1, new Comparator<pair>() {

                        public int compare(pair o1, pair o2) {
                            return o1.index - o2.index;
                        }
                    });
                    Collections.sort(arrayList2, new Comparator<pair>() {

                        public int compare(pair o1, pair o2) {
                            return o1.index - o2.index;
                        }
                    });

                    for (pair i : arrayList1) out.print(i.index + " ");
                    out.println();
                    for (pair i : arrayList2) out.print(i.index + " ");
                    out.println();

                } else {
                    out.println("No");
                    return;
                }


            }


        }

        class pair implements Comparable<pair> {
            int index;
            int value;


            public int compareTo(pair o) {
                return -(this.value - o.value);
            }

            public pair(int index, int value) {
                this.index = index;
                this.value = value;
            }

        }

    }

    static class ScanReader {
        private byte[] buf = new byte[4 * 1024];
        private int index;
        private BufferedInputStream in;
        private int total;

        public ScanReader(InputStream inputStream) {
            in = new BufferedInputStream(inputStream);
        }

        private int scan() {
            if (index >= total) {
                index = 0;
                try {
                    total = in.read(buf);
                } catch (Exception e) {
                    e.printStackTrace();
                }
                if (total <= 0) return -1;
            }
            return buf[index++];
        }

        public int scanInt() {
            int integer = 0;
            int n = scan();
            while (isWhiteSpace(n)) n = scan();
            int neg = 1;
            if (n == '-') {
                neg = -1;
                n = scan();
            }
            while (!isWhiteSpace(n)) {
                if (n >= '0' && n <= '9') {
                    integer *= 10;
                    integer += n - '0';
                    n = scan();
                }
            }
            return neg * integer;
        }

        private boolean isWhiteSpace(int n) {
            if (n == ' ' || n == '\n' || n == '\r' || n == '\t' || n == -1) return true;
            else return false;
        }

    }
}

