#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using pi = pair<LL, int>;
int n;
LL x1, x2;
vector<pi> servers;
int main() {
  cin >> n >> x1 >> x2;
  servers.resize(n + 1);
  for (int i = 1; i <= n; ++i) {
    LL cur;
    cin >> cur;
    servers[i] = make_pair(cur, i);
  }
  sort(servers.begin() + 1, servers.end());
  int a = 0, b = 0;
  for (int i = n; i >= 1; --i) {
    if (servers[i].first * (n - i + 1) >= x1) {
      a = i;
      for (int j = i - 1; j >= 1; --j) {
        if (servers[j].first * (i - j) >= x2) {
          b = j;
          cout << "Yes" << endl;
          cout << (n - a + 1) << ' ' << (a - b) << endl;
          for (int i = n; i >= a; --i) {
            if (i != n) cout << ' ';
            cout << servers[i].second;
          }
          cout << endl;
          for (int i = a - 1; i >= b; --i) {
            if (i != a - 1) cout << ' ';
            cout << servers[i].second;
          }
          cout << endl;
          return 0;
        }
      }
      goto nxtr;
    }
  }
nxtr:
  swap(x1, x2);
  for (int i = n; i >= 1; --i) {
    if (servers[i].first * (n - i + 1) >= x1) {
      a = i;
      for (int j = i - 1; j >= 1; --j) {
        if (servers[j].first * (i - j) >= x2) {
          b = j;
          cout << "Yes" << endl;
          cout << (a - b) << ' ' << (n - a + 1) << endl;
          for (int i = a - 1; i >= b; --i) {
            if (i != a - 1) cout << ' ';
            cout << servers[i].second;
          }
          cout << endl;
          for (int i = n; i >= a; --i) {
            if (i != n) cout << ' ';
            cout << servers[i].second;
          }
          cout << endl;
          return 0;
        }
      }
      cout << "No" << endl;
      return 0;
    }
  }
}
