#include <bits/stdc++.h>
using namespace std;
using matrix = vector<vector<long long>>;
const int MAXN = 3e5 + 100;
pair<int, int> c[MAXN], d[MAXN];
bool solve(int n, int x1, int x2, bool flag) {
  int lf = n - 1, k1 = 1;
  while (true) {
    if (c[lf].first >= x1 / k1 + (x1 % k1 != 0)) {
      break;
    }
    while (c[lf].first < x1 / k1 + (x1 % k1 != 0) && k1 < n) {
      k1++;
    }
    if (k1 == n) {
      return false;
    }
    lf = n - k1;
  }
  for (int i = lf - 1; i >= 0; --i) {
    if (c[i].first >= x1 / k1 + (x1 % k1 != 0)) {
      lf = i;
    }
  }
  int cur = 0;
  for (int i = 0; i < lf; ++i) {
    d[cur++] = c[i];
  }
  for (int i = lf + k1; i < n; ++i) {
    d[cur++] = c[i];
  }
  int rg = cur - 1, k2 = 1;
  while (true) {
    if (d[rg].first >= x2 / k2 + (x2 % k2 != 0)) {
      break;
    }
    while (d[rg].first < x2 / k2 + (x2 % k2 != 0) && k2 <= cur) {
      k2++;
    }
    if (k2 > cur) {
      return false;
    }
    rg = cur - k2;
  }
  cout << "Yes\n";
  if (flag) {
    cout << k2 << ' ' << k1 << '\n';
    for (int i = rg; i < rg + k2; ++i) {
      cout << d[i].second << ' ';
    }
    cout << '\n';
    for (int i = lf; i < lf + k1; ++i) {
      cout << c[i].second << ' ';
    }
  } else {
    cout << k1 << ' ' << k2 << '\n';
    for (int i = lf; i < lf + k1; ++i) {
      cout << c[i].second << ' ';
    }
    cout << '\n';
    for (int i = rg; i < rg + k2; ++i) {
      cout << d[i].second << ' ';
    }
  }
  return true;
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, x1, x2;
  cin >> n >> x1 >> x2;
  for (int i = 0; i < n; ++i) {
    cin >> c[i].first;
    c[i].second = i + 1;
  }
  sort(c, c + n);
  if (solve(n, x1, x2, false)) {
    return 0;
  }
  if (solve(n, x2, x1, true)) {
    return 0;
  }
  cout << "No";
}
