#include <bits/stdc++.h>
using namespace std;
long long n, x1, x2;
vector<pair<long long, long long> > v;
int32_t main() {
  scanf("%lld%lld%lld", &n, &x1, &x2);
  long long l = 1, r = n;
  v.resize(n);
  for (long long i = 0; i < n; i++) scanf("%lld", &v[i].first), v[i].second = i;
  sort(v.begin(), v.end());
  long long r1 = -1, l2 = n - 2, r2 = l2;
  for (long long i = n - 1; i > 0; i--) {
    long long sz = n - i;
    if (sz * v[i].first >= x1) {
      r1 = i;
      break;
    }
  }
  if (r1 != -1) {
    l2 = r1 - 1;
    r2 = -1;
    for (long long i = r1 - 1; i >= 0; i--) {
      long long sz = l2 - i + 1;
      if (sz * v[i].first >= x2) {
        r2 = i;
        break;
      }
    }
    if (r2 != -1) {
      printf("Yes\n");
      printf("%lld %lld\n", n - 1 - r1 + 1, l2 - r2 + 1);
      for (long long i = n - 1; i >= r1; i--) {
        printf("%lld ", v[i].second + 1);
      }
      printf("\n");
      for (long long i = l2; i >= r2; i--) {
        printf("%lld ", v[i].second + 1);
      }
      printf("\n");
      return 0;
    }
  }
  r1 = -1, l2 = n - 2, r2 = l2;
  for (long long i = n - 1; i > 0; i--) {
    long long sz = n - i;
    if (sz * v[i].first >= x2) {
      r1 = i;
      break;
    }
  }
  if (r1 != -1) {
    l2 = r1 - 1;
    r2 = -1;
    for (long long i = r1 - 1; i >= 0; i--) {
      long long sz = l2 - i + 1;
      if (sz * v[i].first >= x1) {
        r2 = i;
        break;
      }
    }
    if (r2 != -1) {
      printf("Yes\n");
      printf("%lld %lld\n", l2 - r2 + 1, n - 1 - r1 + 1);
      for (long long i = l2; i >= r2; i--) {
        printf("%lld ", v[i].second + 1);
      }
      printf("\n");
      for (long long i = n - 1; i >= r1; i--) {
        printf("%lld ", v[i].second + 1);
      }
      printf("\n");
      return 0;
    }
  }
  printf("No");
}
