Resource Distribution
One department of some software company has $$$n$$$ servers of different specifications. Servers are indexed with consecutive integers from $$$1$$$ to $$$n$$$. Suppose that the specifications of the $$$j$$$-th server may be expressed with a single integer number $$$c_j$$$ of artificial resource units.In order for production to work, it is needed to deploy two services $$$S_1$$$ and $$$S_2$$$ to process incoming requests using the servers of the department. Processing of incoming requests of service $$$S_i$$$ takes $$$x_i$$$ resource units.The described situation happens in an advanced company, that is why each service may be deployed using not only one server, but several servers simultaneously. If service $$$S_i$$$ is deployed using $$$k_i$$$ servers, then the load is divided equally between these servers and each server requires only $$$x_i / k_i$$$ (that may be a fractional number) resource units.Each server may be left unused at all, or be used for deploying exactly one of the services (but not for two of them simultaneously). The service should not use more resources than the server provides.Determine if it is possible to deploy both services using the given servers, and if yes, determine which servers should be used for deploying each of the services.
In the first sample test each of the servers 1, 2 and 6 will will provide $$$8 / 3 = 2.(6)$$$ resource units and each of the servers 5, 4 will provide $$$16 / 2 = 8$$$ resource units.In the second sample test the first server will provide $$$20$$$ resource units and each of the remaining servers will provide $$$32 / 3 = 10.(6)$$$ resource units.
The first line contains three integers $$$n$$$, $$$x_1$$$, $$$x_2$$$ ($$$2 \leq n \leq 300\,000$$$, $$$1 \leq x_1, x_2 \leq 10^9$$$) — the number of servers that the department may use, and resource units requirements for each of the services.The second line contains $$$n$$$ space-separated integers $$$c_1, c_2, \ldots, c_n$$$ ($$$1 \leq c_i \leq 10^9$$$) — the number of resource units provided by each of the servers.
If it is impossible to deploy both services using the given servers, print the only word "No" (without the quotes).Otherwise print the word "Yes" (without the quotes). In the second line print two integers $$$k_1$$$ and $$$k_2$$$ ($$$1 \leq k_1, k_2 \leq n$$$) — the number of servers used for each of the services.In the third line print $$$k_1$$$ integers, the indices of the servers that will be used for the first service.In the fourth line print $$$k_2$$$ integers, the indices of the servers that will be used for the second service.No index may appear twice among the indices you print in the last two lines. If there are several possible answers, it is allowed to print any of them.
""""""
import collections
import time
import os
import sys
import bisect
import heapq
(n, x1, x2) = map(int, input().split())
C = [int(x) for x in input().split()]
C = [(v, i + 1) for (i, v) in enumerate(C)]
C.sort()

def check(x1, x2, rev):
    r = n
    (p1, p2) = ([], [])
    for i in range(n - 1, -1, -1):
        if C[i][0] * (n - i) >= x1:
            r = i
            p1 = [v[1] for v in C[i:]]
            break
    if p1:
        for i in range(r, -1, -1):
            if C[i][0] * (r - i) >= x2:
                p2 = [v[1] for v in C[i:r]]
                if rev:
                    (p1, p2) = (p2, p1)
                print('Yes')
                print('{} {}'.format(len(p1), len(p2)))
                print(' '.join(map(str, p1)))
                print(' '.join(map(str, p2)))
                exit(0)
check(x1, x2, False)
check(x2, x1, True)
print('No')
def readline():
    return tuple(map(int, input().split()))

def ceil_div(num, den):
    return (num - 1) // den + 1

def main():
    (n, x1, x2) = readline()
    c = readline()
    xx = (x1, x2)
    servers = sorted(enumerate(c, start=1), key=lambda p: p[1])
    for (i, a) in enumerate(servers):
        for (j, x) in enumerate(xx):
            kj = ceil_div(x, a[1])
            if i + kj < n and (n - i - kj) * servers[i + kj][1] >= sum(xx) - x:
                print('Yes')
                l1 = servers[i:i + kj]
                l2 = servers[i + kj:]
                if j:
                    (l1, l2) = (l2, l1)
                print(len(l1), len(l2))
                print(' '.join((str(d[0]) for d in l1)))
                print(' '.join((str(d[0]) for d in l2)))
                return
    print('No')
main()
def fin(c, x):
    return (x + c - 1) // c

def ck(x, b):
    r = (n, n)
    for i in range(b, n):
        r = min(r, (i + fin(c[i][0], x), i))
    return r

def sol(r, l):
    if r[0] <= n and l[0] <= n and (r[1] < n) and (l[1] < n):
        print('Yes')
        print(r[0] - r[1], l[0] - l[1])
        print(' '.join([str(x[1]) for x in c[r[1]:r[0]]]))
        print(' '.join([str(x[1]) for x in c[l[1]:l[0]]]))
        return True
    else:
        return False
(n, x1, x2) = [int(x) for x in input().split()]
c = sorted([(int(x), i + 1) for (i, x) in enumerate(input().split())])
r1 = ck(x1, 0)
l1 = ck(x2, r1[0])
r2 = ck(x2, 0)
l2 = ck(x1, r2[0])
if not sol(r1, l1) and (not sol(l2, r2)):
    print('No')