#include <bits/stdc++.h>
using namespace std;
long long n, x1, x2, x;
vector<long long> a, b;
vector<pair<long long, long long> > v;
bool solve(long long x1, long long x2) {
  long long i = 0, cnt = 0, idx, idx2;
  while (i < n) {
    cnt++;
    if (cnt * v[i].first >= x1) {
      idx = i;
      break;
    }
    i++;
  }
  if (i == n) return false;
  i = idx + 1;
  cnt = 0;
  while (i < n) {
    cnt++;
    if (cnt * v[i].first >= x2) {
      idx2 = i;
      break;
    }
    i++;
  }
  if (i == n) return false;
  for (int i = 0; i <= idx; i++) {
    a.push_back(v[i].second);
  }
  for (int i = idx + 1; i <= idx2; i++) {
    b.push_back(v[i].second);
  }
  return true;
}
int main() {
  cin >> n >> x1 >> x2;
  for (int i = 1; i <= n; i++) {
    cin >> x;
    v.push_back({x, i});
  }
  sort(v.rbegin(), v.rend());
  bool valid = solve(x1, x2);
  if (!valid) {
    valid = solve(x2, x1);
    swap(a, b);
  }
  if (!valid)
    cout << "No" << endl;
  else {
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());
    cout << "Yes" << endl;
    cout << a.size() << " " << b.size() << endl;
    for (int i = 0; i < a.size(); i++) cout << a[i] << " ";
    cout << endl;
    for (int i = 0; i < b.size(); i++) cout << b[i] << " ";
    cout << endl;
  }
  return 0;
}
