import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.io.BufferedWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.ArrayList;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.Comparator;
import java.util.Collections;
import java.io.InputStream;
/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        OutputWriter out = new OutputWriter(outputStream);
        TaskD solver = new TaskD();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskD {
        OutputWriter out;
        String YES = "Yes";
        String NO = "No";

        boolean attempt(int x1, int x2, IntIntPair[] originalC, boolean swapped) {
            IntIntPair[] c = new IntIntPair[originalC.length];
            for (int i = 0; i < c.length; i++) {
                c[i] = new IntIntPair(originalC[i].first, originalC[i].second);
            }
            ArrayList<Integer> x1Needed = null;
            {
                for (int x1Used = 0; x1Used < c.length; x1Used++) {
                    int divisor = x1Used + 1;
                    int last = c[x1Used].first;
                    if ((long) last * divisor >= x1) {
                        x1Needed = new ArrayList<>();
                        for (int i = 0; i <= x1Used; i++) {
                            x1Needed.add(c[i].second);
                        }
                        c = Arrays.copyOfRange(c, x1Used + 1, c.length);
                        break;
                    }
                }
                if (x1Needed == null) {
                    return false;
                }
            }
            ArrayList<Integer> x2Needed = null;
            {
                for (int x2Used = 0; x2Used < c.length; x2Used++) {
                    int divisor = x2Used + 1;
                    int last = c[x2Used].first;
                    if ((long) last * divisor >= x2) {
                        x2Needed = new ArrayList<>();
                        for (int i = 0; i <= x2Used; i++) {
                            x2Needed.add(c[i].second);
                        }
                        break;
                    }
                }
                if (x2Needed == null) {
                    return false;
                }
            }
            if (swapped) {
                ArrayList<Integer> temp = x1Needed;
                x1Needed = x2Needed;
                x2Needed = temp;
            }
            Collections.sort(x1Needed);
            Collections.sort(x2Needed);
            out.printLine(YES);
            out.printLine(x1Needed.size(), x2Needed.size());
            for (int val : x1Needed) {
                out.print(val + 1 + " ");
            }
            out.printLine();
            for (int val : x2Needed) {
                out.print(val + 1 + " ");
            }
            out.printLine();
            return true;
        }

        public void solve(int testNumber, InputReader in, OutputWriter out) {
            this.out = out;
            int n = in.readInt();
            int x1 = in.readInt();
            int x2 = in.readInt();
            IntIntPair[] c = new IntIntPair[n];
            for (int i = 0; i < c.length; i++) {
                c[i] = new IntIntPair(in.readInt(), i);
            }
            Arrays.sort(c, new Comparator<IntIntPair>() {
                public int compare(IntIntPair o1, IntIntPair o2) {
                    return -Integer.compare(o1.first, o2.first);
                }
            });
            if (attempt(x1, x2, c, false)) return;
            if (attempt(x2, x1, c, true)) return;
            out.printLine(NO);
        }
    }
    static class IntIntPair implements Comparable<IntIntPair> {
        public final int first;
        public final int second;

        public IntIntPair(int first, int second) {
            this.first = first;
            this.second = second;
        }

        public boolean equals(Object o) {
            if (this == o) {
                return true;
            }
            if (o == null || getClass() != o.getClass()) {
                return false;
            }
            IntIntPair pair = (IntIntPair) o;
            return first == pair.first && second == pair.second;
        }

        public int hashCode() {
            int result = first;
            result = 31 * result + second;
            return result;
        }

        public String toString() {
            return "(" + first + "," + second + ")";
        }

        @SuppressWarnings ({"unchecked"})
        public int compareTo(IntIntPair o) {
            int value = Integer.compare(first, o.first);
            if (value != 0) {
                return value;
            }
            return Integer.compare(second, o.second);
        }
    }
    static class OutputWriter {
        private final PrintWriter writer;

        public OutputWriter(OutputStream outputStream) {
            writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
        }

        public OutputWriter(Writer writer) {
            this.writer = new PrintWriter(writer);
        }

        public void print(Object... objects) {
            for (int i = 0; i < objects.length; i++) {
                if (i != 0) {
                    writer.print(' ');
                }
                writer.print(objects[i]);
            }
        }

        public void printLine() {
            writer.println();
        }

        public void printLine(Object... objects) {
            print(objects);
            writer.println();
        }

        public void close() {
            writer.close();
        }
    }
    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private InputReader.SpaceCharFilter filter;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (numChars == -1) {
                throw new InputMismatchException();
            }
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0) {
                    return -1;
                }
            }
            return buf[curChar++];
        }

        public int readInt() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public boolean isSpaceChar(int c) {
            if (filter != null) {
                return filter.isSpaceChar(c);
            }
            return isWhitespace(c);
        }

        public static boolean isWhitespace(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);
        }
    }
}

