import java.io.BufferedInputStream;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Arrays;

public class D {

	static server ar[];
	public static void main(String[] args) {
		JS in = new JS();
		PrintWriter out = new PrintWriter(System.out);
		int N = in.nextInt();
		int x1 = in.nextInt();
		int x2 = in.nextInt();
		boolean found = false;
		ar = new server[N];
		for(int i = 0; i < N; i++) {
			ar[i] = new server(in.nextInt(), i+1);
		}
		Arrays.sort(ar);
		int best[] = new int[N];
		for(int i = N-1; i >= 0; i--) {
			int min = ar[i].c;
			long v = (long)min*(long)(N-i);
			if(v > Integer.MAX_VALUE/2) v = Integer.MAX_VALUE/2;
			best[i] = (int)v;
		}
		RMQ rmq = new RMQ(best);
		
		
		//Giving i servers for thingy x1
		for(int i = 1; i < N; i++) {
			int each = x1/i;
			if(x1%i != 0) each++;
			//Get lowest working index
			int low = bs(0, N, each);
			int hi = low+i-1;
			if(low == N || ar[low].c < each || hi >= N) continue; //Not going to work

			//We are using comps lo to hi for this. Try and see if rest can do it for x2
			
			int right = hi>=N-1?0: rmq.query(hi+1, N);
			if(right >= x2) { //possible
				found = true;
				out.println("Yes\n");
				out.println(i+" "+(N-hi-1));
				for(int j = low; j <= hi; j++) out.print(ar[j].id+" ");
				out.println();
				for(int j = hi+1; j < N; j++) out.print(ar[j].id+" ");
				out.println();
				break;
			}
			
		}
		
		if(!found) {
			int temp =x1;
			x1 = x2;
			x2 = temp;
			//Giving i servers for thingy x1
			for(int i = 1; i < N; i++) {
				int each = x1/i;
				if(x1%i != 0) each++;
				//Get lowest working index
				int low = bs(0, N, each);
				int hi = low+i-1;
				if(low == N || ar[low].c < each || hi >= N) continue; //Not going to work
		
				//We are using comps lo to hi for this. Try and see if rest can do it for x2
						
				int right = hi>=N-1?0: rmq.query(hi+1, N);
				if(right >= x2) { //possible
					found = true;
					out.println("Yes");
					out.println((N-hi-1)+" "+i);
					for(int j = hi+1; j < N; j++) out.print(ar[j].id+" ");
					out.println();
					for(int j = low; j <= hi; j++)out.print(ar[j].id+" ");			
					out.println();
					break;
				}
				
			}
		}
		if(!found) out.println("No");
		out.close();
		
	}
	
	

	static int bs(int lo, int hi, int tar) {
		if(lo==hi) return lo;
		if(lo+1 == hi) {
			if(ar[lo].c >= tar) return lo;
			return hi;
		}
		int mid = (lo+hi)/2;
		if(ar[mid].c >= tar) return bs(lo, mid, tar);
		return bs(mid, hi, tar);
	}
	
	static class server implements Comparable<server>{
		int c, id;
		public server(int cc, int ii) {
			c=cc;
			id=ii;
		}
		@Override
		public int compareTo(server o) {
			return this.c-o.c;
		}
	}
	
	static class RMQ {
		int[] vs;
		int[][] lift;

		public RMQ(int[] vs) {
			this.vs = vs;
			int n = vs.length;
			int maxlog = Integer.numberOfTrailingZeros(Integer.highestOneBit(n)) + 2;
			lift = new int[maxlog][n];
			for (int i = 0; i < n; i++)
				lift[0][i] = vs[i];
			int lastRange = 1;
			for (int lg = 1; lg < maxlog; lg++) {
				for (int i = 0; i < n; i++) {
					lift[lg][i] = Math.max(lift[lg - 1][i], lift[lg - 1][Math.min(i + lastRange, n - 1)]);
				}
				lastRange *= 2;
			}
		}

		public int query(int low, int hi) {
			int range = hi - low + 1;
			int exp = Integer.highestOneBit(range);
			int lg = Integer.numberOfTrailingZeros(exp);
			return Math.max(lift[lg][low], lift[lg][hi - exp + 1]);
		}
	}
	
	static class JS{
		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 JS() {
			in = new BufferedInputStream(System.in, BS);
		}
		
		public JS(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;
			}
		}
	}
	
}
