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

public class D implements Runnable{
	public static void main (String[] args) {new Thread(null, new D(), "_cf", 1 << 28).start();}

	public void run() {
		FastScanner fs = new FastScanner();
		PrintWriter out = new PrintWriter(System.out);
		System.err.println("Go!");

		int n = fs.nextInt();
		int[] xs = fs.nextIntArray(2);
		int[] cnts = new int[2];
		int[] mark = new int[n]; //0 = not used 1 = x1 2 = x2
		Num[] a = new Num[n];
		for(int i = 0; i < n; i++) a[i] = new Num(i, fs.nextInt());
		Arrays.sort(a);
//		System.out.println(Arrays.toString(a));
		boolean found = false;
		for(int i = 0; i < n; i++) {
			//how much to cover the smaller one?
			Num find = findIt(a, xs, cnts, mark, i, 0);
			if(find != null) {
				found = true;
				break;
			}
			find = findIt(a, xs, cnts, mark, i, 1);
			if(find != null) {
				found = true;
				break;
			}
		}
		
		if(!found) out.println("No");
		else {
			cnts[0] = cnts[1] = 0;
			for(int i = 0; i < n; i++) if(mark[i] > 0) cnts[mark[i]-1]++;
			out.println("Yes");
			out.printf("%d %d\n", cnts[0], cnts[1]);
			for(int i = 0; i < n; i++) {
				if(mark[i] == 1) out.print((i+1) + " ");
			}
			out.println();
			for(int i = 0; i < n; i++) {
				if(mark[i] == 2) out.print((i+1) + " ");
			}
			out.println();

		}
		
		out.close();
	}
	
	Num findIt(Num[] a, int[] xs, int[] cnts, int[] mark, int i, int type) {
		int n = a.length;
		int cover;
		if(type == 0) cover = 0;
		else cover = 1;
		int lo = i, hi = n - 1;
		int bestSmall = -1;
		for(int bs = 0; bs < 50 && lo <= hi; bs++) {
			int mid = ((lo + hi) >> 1);
			long len = mid - i + 1;
			if(xs[cover] <= len * a[i].val) {
				bestSmall = mid;
				hi = mid - 1;
			}
			else {
				lo = mid + 1;
			}
		}
		
		if(bestSmall == -1) return null;
		
		int bestLarge = -1;
		lo = bestSmall + 1; hi = n - 1;
		
		for(int bs = 0; bs < 50 && lo <= hi; bs++) {
			int mid = ((lo + hi) >> 1);
			long len = n - mid;
			if(xs[cover^1] <= len * a[mid].val) {
				bestLarge = mid;
				lo = mid + 1;
			}
			else {
				hi = mid - 1;
			}
		}
		
		if(bestLarge == -1) {
			long total = n - bestSmall - 1;
			
			lo = 0; hi = i - 1;
			for(int bs = 0; bs < 50 && lo <= hi; bs++) {
				int mid = ((lo + hi) >> 1);
				long len = total + (i - mid);
				if(xs[cover^1] <= len * a[mid].val) {
					bestLarge = mid;
					lo = mid + 1;
				}
				else {
					hi = mid - 1;
				}
			}
			
			if(bestLarge == -1)
				return null;
		}
		
//		System.out.printf("Found at %d\nBestSmall %d BestLarge %d\n", i, bestSmall, bestLarge);
		
		boolean smallOne = cover == 0;
		for(int j = i; j <= bestSmall; j++) {
			if(smallOne) mark[a[j].idx] = 1;
			else mark[a[j].idx] = 2;
		}
		for(int j = n - 1; j >= bestLarge; j--) {
			if(mark[a[j].idx] != 0) continue;
			if(smallOne) mark[a[j].idx] = 2;
			else mark[a[j].idx] = 1;
		}
		return new Num(bestSmall, bestLarge);
	}
	
	class Num implements Comparable<Num> {
		int idx, val;
		Num (int a, int b) { idx = a; val = b; }
		public int compareTo(Num o) {return Integer.compare(val, o.val);}
		public String toString() { return val + " " + idx;}
	}

	void sort (int[] a) {
		int n = a.length;
		for(int i = 0; i < 50; i++) {
			Random r = new Random();
			int x = r.nextInt(n), y = r.nextInt(n);
			int temp = a[x];
			a[x] = a[y];
			a[y] = temp;
		}
		Arrays.sort(a);
	}

	class FastScanner {
		public int BS = 1<<16;
		public char NC = (char)0;
		byte[] buf = new byte[BS];
		int bId = 0, size = 0;
		char c = NC;
		double num = 1;
		BufferedInputStream in;

		public FastScanner() {
			in = new BufferedInputStream(System.in, BS);
		}

		public FastScanner(String s) throws FileNotFoundException {
			in = new BufferedInputStream(new FileInputStream(new File(s)), BS);
		}

		public char nextChar(){
			while(bId==size) {
				try {
					size = in.read(buf);
				}catch(Exception e) {
					return NC;
				}                
				if(size==-1)return NC;
				bId=0;
			}
			return (char)buf[bId++];
		}

		public int nextInt() {
			return (int)nextLong();
		}

		public long nextLong() {
			num=1;
			boolean neg = false;
			if(c==NC)c=nextChar();
			for(;(c<'0' || c>'9'); c = nextChar()) {
				if(c=='-')neg=true;
			}
			long res = 0;
			for(; c>='0' && c <='9'; c=nextChar()) {
				res = (res<<3)+(res<<1)+c-'0';
				num*=10;
			}
			return neg?-res:res;
		}

		public double nextDouble() {
			double cur = nextLong();
			return c!='.' ? cur:cur+nextLong()/num;
		}

		public String next() {
			StringBuilder res = new StringBuilder();
			while(c<=32)c=nextChar();
			while(c>32) {
				res.append(c);
				c=nextChar();
			}
			return res.toString();
		}

		public String nextLine() {
			StringBuilder res = new StringBuilder();
			while(c<=32)c=nextChar();
			while(c!='\n') {
				res.append(c);
				c=nextChar();
			}
			return res.toString();
		}

		public boolean hasNext() {
			if(c>32)return true;
			while(true) {
				c=nextChar();
				if(c==NC)return false;
				else if(c>32)return true;
			}
		}
		
		public int[] nextIntArray(int n) {
			int[] res = new int[n];
			for(int i = 0; i < n; i++) res[i] = nextInt();
			return res;
		}
		
	}

}