#include <bits/stdc++.h>
using namespace std;
long long sqr(long long x) { return x * x; }
int mysqrt(long long x) {
  int l = 0, r = 1e9 + 1;
  while (r - l > 1) {
    int m = (l + r) / 2;
    if (m * (long long)m <= x)
      l = m;
    else
      r = m;
  }
  return l;
}
mt19937 rnd(1227);
mt19937_64 rndll(12365);
long long AR = 19, BR = 13, CR = 23, XR = 228, YR = 322, MODR = 1e9 + 993;
long long myrand() {
  long long ZR = (XR * AR + YR * BR + CR) % MODR;
  XR = YR;
  YR = ZR;
  return ZR;
}
const int Mod = 1e9 + 7;
int bpow(int x, int y) {
  if (y == 0) return 1;
  if (y == 1) return x;
  int ret = bpow(x, y >> 1);
  ret = (ret * (long long)ret) % Mod;
  if (y & 1) ret = (ret * (long long)x) % Mod;
  return ret;
}
int bdiv(int x, int y) { return (x * (long long)bpow(y, Mod - 2)) % Mod; }
void setmin(int &x, int y) { x = min(x, y); }
void setmax(int &x, int y) { x = max(x, y); }
void setmin(long long &x, long long y) { x = min(x, y); }
void setmax(long long &x, long long y) { x = max(x, y); }
int gcd(int a, int b) { return a ? gcd(b % a, a) : b; }
const long long llinf = 2e18 + 100;
const double eps = 1e-9;
const int maxn = 3e5 + 100, maxw = 1e6 + 100, inf = 2e9 + 100, sq = 300,
          mod = 1e9 + 993, LG = 17;
int n;
int w[2];
pair<int, int> a[maxn];
int q[maxn][2];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> w[0] >> w[1];
  for (int i = 0; i < n; i++) cin >> a[i].first, a[i].second = i;
  for (int i = 0; i < n; i++) q[i][0] = n + 1, q[i][1] = n + 1;
  sort(a, a + n);
  for (int t = 0; t < 2; t++) {
    for (int i = 1; i <= n; i++) {
      int l = -1, r = n;
      while (r - l > 1) {
        int m = (l + r) / 2;
        if (a[m].first * (long long)i >= w[t])
          r = m;
        else
          l = m;
      }
      setmin(q[r][t], i);
    }
  }
  int x = n + 1;
  for (int i = n - 1; i >= 0; i--) {
    if (n - i >= q[i][0]) setmin(x, q[i][0]);
    if (x + q[i][1] <= n - i) {
      cout << "Yes\n" << x << ' ' << q[i][1] << '\n';
      for (int j = 1; j <= x; j++) cout << a[n - j].second + 1 << ' ';
      cout << '\n';
      for (int j = 1; j <= q[i][1]; j++) cout << a[n - x - j].second + 1 << ' ';
      return 0;
    }
  }
  x = n + 1;
  for (int i = n - 1; i >= 0; i--) {
    if (n - i >= q[i][1]) setmin(x, q[i][1]);
    if (x + q[i][0] <= n - i) {
      cout << "Yes\n" << q[i][0] << ' ' << x << '\n';
      for (int j = 1; j <= q[i][0]; j++) cout << a[n - x - j].second + 1 << ' ';
      cout << '\n';
      for (int j = 1; j <= x; j++) cout << a[n - j].second + 1 << ' ';
      return 0;
    }
  }
  cout << "No";
}
