import java.io.*;
import java.util.*;

public class Main {

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

		public InputReader() {
			reader = new BufferedReader(new InputStreamReader(System.in), 32765);
			tokenizer = null;
		}

		public InputReader(InputStream stream) {
			reader = new BufferedReader(new InputStreamReader(stream), 32765);
			tokenizer = null;
		}

		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 char nextChar() {
			return next().charAt(0);
		}

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

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

		public double nextDouble() {
			return Double.parseDouble(next());
		}

		public int[] nextIntArr(int n) {
			int[] arr = new int[n];
			for (int i = 0; i < n; i++) {
				arr[i] = this.nextInt();
			}
			return arr;
		}

		public int[][] next2DIntArr(int n, int m) {
			int[][] arr = new int[n][m];
			for (int i = 0; i < n; i++) {
				for (int j = 0; j < m; j++) {
					arr[i][j] = this.nextInt();
				}
			}
			return arr;
		}

		public int[] nextSortedIntArr(int n) {
			int[] arr = new int[n];
			for (int i = 0; i < n; i++) {
				arr[i] = this.nextInt();
			}
			Arrays.sort(arr);
			return arr;
		}

		public long[] nextLongArr(int n) {
			long[] arr = new long[n];
			for (int i = 0; i < n; i++) {
				arr[i] = this.nextLong();
			}
			return arr;
		}

		public long[] nextSortedLongArr(int n) {
			long[] arr = new long[n];
			for (int i = 0; i < n; i++) {
				arr[i] = this.nextInt();
			}
			Arrays.sort(arr);
			return arr;
		}

		public char[] nextCharArr(int n) {
			char[] arr = new char[n];
			for (int i = 0; i < n; i++) {
				arr[i] = this.nextChar();
			}
			return arr;
		}
	}

	public static InputReader scn = new InputReader();
	public static PrintWriter out = new PrintWriter(System.out);

	public static class tupple {
		int s1, s2, l1, l2;
		boolean valid = false;

		tupple() {
			s1 = s2 = l1 = l2 = -1;
		}
	}

	public static class pair implements Comparable<pair> {
		long val;
		int ind;

		@Override
		public int compareTo(pair o) {
			return (int) (this.val - o.val);
		}

		public String toString() {
			return val + "";
		}
	}

	public static void main(String[] args) {
		// InputStream inputStream = System.in; // Useful when taking input other than
		// console eg file handling // check ctor of inputReader
		// To print in file use this:- out = new PrintWriter("destination of file")
		// including extension");

		int n = scn.nextInt();
		long x1 = scn.nextLong(), x2 = scn.nextLong();
		pair[] arr = new pair[n];
		for (int i = 0; i < n; i++) {
			arr[i] = new pair();
			arr[i].ind = i;
			arr[i].val = scn.nextLong();
		}
		Arrays.sort(arr);

		tupple t1 = func(n, x1, x2, arr), t2 = func(n, x2, x1, arr);

		if (!(t1.valid || t2.valid)) {
			out.println("No");
		} else if (t1.valid) {
			out.println("Yes");
			int s1 = t1.l1 - t1.s1 + 1, s2 = t1.l2 - t1.s2 + 1;
			out.println(s1 + " " + s2);
			for (int i = t1.s1; i <= t1.l1; i++) {
				out.print(arr[i].ind + 1 + " ");
			}
			out.println();
			for (int i = t1.s2; i <= t1.l2; i++) {
				out.print(arr[i].ind + 1 + " ");
			}
		} else {
			out.println("Yes");
			int s2 = t2.l1 - t2.s1 + 1, s1 = t2.l2 - t2.s2 + 1;
			out.println(s1 + " " + s2);
			for (int i = t2.s2; i <= t2.l2; i++) {
				out.print(arr[i].ind + 1 + " ");
			}
			out.println();
			for (int i = t2.s1; i <= t2.l1; i++) {
				out.print(arr[i].ind + 1 + " ");
			}
		}
		out.close();
	}

	public static tupple func(int n, long x1, long x2, pair[] arr) {
		tupple t = new tupple();
		int s1 = 1, s2 = 1;
		for(int i = n - 1; i >= 0; i--) {
			if(arr[i].val * s1 >= x1) {
				t.l1 = n - 1;
				t.s1 = i;
				break;
			} else {
				s1++;
			}
		}
		
		for(int i = t.s1 - 1; i >= 0; i--) {
			if(arr[i].val * s2 >= x2) {
				t.l2 = t.s1 - 1;
				t.s2 = i;
				t.valid = true;
				break;
			} else {
				s2++;
			}
		}

		return t;
	}

	public static long f(long a, long b) {
		return a % b == 0 ? a / b : a / b + 1;
	}
}
