#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-9;
pair<long long, long long> a[300005];
long long n;
bool solve(long long x1, long long x2, bool swp) {
  long long danger = 1;
  while (a[n - danger].first < (1. * x2 / danger)) danger++;
  long long ddx = n - danger;
  while (ddx > 0 && a[ddx - 1].first >= (1. * x2 / danger)) ddx--;
  long long l = n - 1;
  vector<long long> ans, other;
  bool can = false;
  long long cnt = 0;
  while (l >= 0 && can == false) {
    if (l < ddx || l >= ddx + danger) {
      cnt++;
      if (a[l].first >= 1. * x1 / cnt) {
        can = true;
        for (long long j = long long(min(ddx, l)); j < long long(n); j++) {
          if (j < ddx || j >= ddx + danger)
            ans.push_back(a[j].second);
          else
            other.push_back(a[j].second);
        }
      }
    }
    l--;
  }
  if (can) {
    if (swp) swap(ans, other);
    cout << "Yes" << '\n';
    cout << (long long)(ans).size() << " " << (long long)(other).size() << '\n';
    for (long long i = long long(0); i < long long((long long)(ans).size());
         i++)
      cout << ans[i] << " ";
    cout << '\n';
    for (long long i = long long(0); i < long long((long long)(other).size());
         i++)
      cout << other[i] << " ";
    cout << '\n';
    return true;
  }
  return false;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long x1, x2;
  cin >> n >> x1 >> x2;
  for (long long i = long long(0); i < long long(n); i++) {
    cin >> a[i].first;
    a[i].second = i + 1;
  }
  sort(a, a + n);
  if (!solve(x1, x2, false)) {
    if (!solve(x2, x1, true)) cout << "No" << '\n';
  }
  return 0;
}
