#include <bits/stdc++.h>
using namespace std;
using vi = vector<long long int>;
using vvi = vector<vi>;
using vb = vector<bool>;
using vc = vector<char>;
using vs = vector<string>;
using vld = vector<long double>;
using pii = pair<long long int, long long int>;
using psi = pair<string, long long int>;
using pci = pair<char, long long int>;
using vpii = vector<pii>;
long long int mod = 1e9 + 7;
long long int const maxn = 1e5 + 5;
long long int const inf = 1e18;
long long int dx[] = {0, 0, 1, -1};
long long int dy[] = {1, -1, 0, 0};
long long int add(long long int a, long long int b) {
  return ((a % mod) + (b % mod)) % mod;
}
long long int mul(long long int a, long long int b) {
  return ((a % mod) * (b % mod)) % mod;
}
long long int powm(long long int x, long long int n, long long int M) {
  long long int result = 1;
  while (n > 0) {
    if (n % 2 == 1) result = (result * x) % M;
    x = (x * x) % M;
    n = n / 2;
  }
  return result;
}
long long int modinverse(long long int a, long long int m) {
  return powm(a, m - 2, m);
}
bool prime(long long int x) {
  if (x <= 1) return false;
  for (int i = 2; i <= sqrt(x); i++)
    if (x % i == 0) return false;
  return true;
}
long long int divisor(long long int x) {
  long long int cnt = 0;
  for (int i = 1; i <= sqrt(x); i++) {
    if (x % i == 0) {
      if (i != x / i)
        cnt += 2;
      else
        cnt += 1;
    }
  }
  return cnt;
}
vector<long long int> sieve(long long int n) {
  bool prim[n + 1];
  memset(prim, true, sizeof(prim));
  for (long long int p = 2; p * p <= n; p++) {
    if (prim[p] == true) {
      for (int i = p * p; i <= n; i += p) prim[i] = false;
    }
  }
  vector<long long int> v;
  for (int i = 2; i <= n; i++)
    if (prim[i]) v.push_back(i);
  return v;
}
long long int get(vpii &v, long long int n, long long int x) {
  for (int i = n - 1; i >= 0; i--) {
    long long int k = n - i;
    if (v[i].first * k >= x) {
      return i;
    }
  }
  return -1;
}
void solve() {
  long long int n, x1, x2;
  cin >> n >> x1 >> x2;
  vpii v(n);
  for (int i = 0; i < n; i++) {
    cin >> v[i].first;
    v[i].second = i + 1;
  }
  sort(v.begin(), v.end());
  long long int a = get(v, n, x1);
  long long int b = get(v, a, x2);
  bool rev = false;
  if (b == -1) {
    rev = true;
    a = get(v, n, x2);
    b = get(v, a, x1);
    if (b == -1) {
      cout << "No\n";
      return;
    }
  }
  cout << "Yes\n";
  vi ans1, ans2;
  for (int i = a; i < n; i++) ans1.push_back(v[i].second);
  for (int i = b; i < a; i++) {
    ans2.push_back(v[i].second);
  }
  if (rev) swap(ans1, ans2);
  cout << (long long int)ans1.size() << " " << (long long int)ans2.size()
       << "\n";
  for (auto i : ans1) cout << i << " ";
  cout << "\n";
  for (auto i : ans2) cout << i << " ";
}
int main() {
  long long int t;
  t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
