#include <bits/stdc++.h>
using namespace std;
int read() {
  static int x;
  static char ch;
  static bool pd;
  pd = true;
  x = 0;
  for (ch = getchar(); ch > '9' || ch < '0'; ch = getchar())
    if (ch == '-') pd = false;
  for (; ch >= '0' && ch <= '9'; ch = getchar()) x = x * 10 + ch - '0';
  return pd ? x : -x;
}
struct node {
  int x, pos;
} a[300010];
int n, S1, S2, x1, p, cnt;
bool cmp(node a, node b) { return a.x < b.x; }
int main() {
  n = read();
  S1 = read();
  S2 = read();
  for (int i = 1; i <= n; ++i) a[i].x = read(), a[i].pos = i;
  sort(a + 1, a + 1 + n, cmp);
  for (int i = 1; i <= n; ++i) {
    cnt = S1 / a[n - i + 1].x + (S1 % a[n - i + 1].x ? 1 : 0);
    p = i - cnt;
    if (p > 0 && (S2 + p - 1) / p <= a[n - p + 1].x) {
      puts("Yes");
      printf("%d %d\n", cnt, p);
      for (int j = n - i + 1; j < n - p + 1; ++j) printf("%d ", a[j].pos);
      puts("");
      for (int j = n - p + 1; j <= n; ++j) printf("%d ", a[j].pos);
      puts("");
      return 0;
    }
    cnt = S2 / a[n - i + 1].x + (S2 % a[n - i + 1].x ? 1 : 0);
    p = i - cnt;
    if (p > 0 && (S1 + p - 1) / p <= a[n - p + 1].x) {
      puts("Yes");
      printf("%d %d\n", p, cnt);
      for (int j = n - p + 1; j <= n; ++j) printf("%d ", a[j].pos);
      puts("");
      for (int j = n - i + 1; j < n - p + 1; ++j) printf("%d ", a[j].pos);
      puts("");
      return 0;
    }
  }
  puts("No");
  return 0;
}
