#include <bits/stdc++.h>
using namespace std;
struct node {
  int data, pos;
} a[300005];
int n, x, y;
bool cmp(node a, node b) { return a.data < b.data; }
int main() {
  cin >> n >> x >> y;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i].data);
    a[i].pos = i;
  }
  sort(a + 1, a + n + 1, cmp);
  for (int i = 1; i <= n; i++) {
    int tmp;
    if (x % a[i].data == 0)
      tmp = x / a[i].data;
    else
      tmp = x / a[i].data + 1;
    if (n - i + 1 <= tmp) continue;
    for (int j = i + tmp; j <= n; j++) {
      int m;
      if (y % a[j].data == 0)
        m = y / a[j].data;
      else
        m = y / a[j].data + 1;
      if (n - j + 1 >= m) {
        cout << "Yes\n";
        cout << tmp << " " << m << endl;
        for (int k = i; k <= i + tmp - 1; k++) cout << a[k].pos << " ";
        cout << endl;
        for (int k = i + tmp; k <= i + tmp + m - 1; k++)
          cout << a[k].pos << " ";
        cout << endl;
        return 0;
      } else
        break;
    }
  }
  for (int i = 1; i <= n; i++) {
    int tmp;
    if (y % a[i].data == 0)
      tmp = y / a[i].data;
    else
      tmp = y / a[i].data + 1;
    if (n - i + 1 <= tmp) continue;
    for (int j = i + tmp; j <= n; j++) {
      int m;
      if (x % a[j].data == 0)
        m = x / a[j].data;
      else
        m = x / a[j].data + 1;
      if (n - j + 1 >= m) {
        cout << "Yes\n";
        cout << m << " " << tmp << endl;
        for (int k = i + tmp; k <= i + tmp + m - 1; k++)
          cout << a[k].pos << " ";
        cout << endl;
        for (int k = i; k <= i + tmp - 1; k++) cout << a[k].pos << " ";
        cout << endl;
        return 0;
      } else
        break;
    }
  }
  cout << "No\n";
  return 0;
}
