#include <bits/stdc++.h>
using namespace std;
const long long M = 1e9 + 7;
const long long INF = 1e9;
inline long long pwr(long long base, long long n, long long m) {
  long long ans = 1;
  while (n > 0) {
    if (n % 2 == 1) ans = (ans * base) % m;
    base = (base * base) % m;
    n /= 2;
  }
  return ans;
}
struct server {
  long double r;
  int ind;
} s[300002];
bool comp(server s1, server s2) { return s1.r < s2.r; }
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n;
  long double x1, x2;
  cin >> n >> x1 >> x2;
  for (int i = 0; i < n; i++) {
    cin >> s[i].r;
    s[i].ind = i + 1;
  }
  sort(s, s + n, comp);
  int cc = 0;
  int j = n + 1;
  for (int i = n - 1; i >= 0; i--) {
    cc++;
    long double temp = x1 / cc;
    if (s[i].r >= temp) {
      int cc1 = 0;
      if (j >= i) j = i - 1;
      for (; j >= 0; j--) {
        cc1 = i - j;
        long double temp1 = x2 / cc1;
        if (s[j].r >= temp1) {
          cout << "Yes\n";
          int i1 = i, j1 = j;
          cout << cc << " " << cc1 << "\n";
          while (cc--) {
            cout << s[i1].ind << " ";
            i1++;
          }
          cout << "\n";
          while (cc1--) {
            cout << s[j1].ind << " ";
            j1++;
          }
          return 0;
        }
      }
    }
  }
  cc = 0;
  j = n + 1;
  for (int i = n - 1; i >= 0; i--) {
    cc++;
    long double temp = x2 / cc;
    if (s[i].r >= temp) {
      int cc1 = 0;
      if (j >= i) j = i - 1;
      for (; j >= 0; j--) {
        cc1 = i - j;
        long double temp1 = x1 / cc1;
        if (s[j].r >= temp1) {
          cout << "Yes\n";
          int i1 = i, j1 = j;
          cout << cc1 << " " << cc << "\n";
          while (cc1--) {
            cout << s[j1].ind << " ";
            j1++;
          }
          cout << "\n";
          while (cc--) {
            cout << s[i1].ind << " ";
            i1++;
          }
          return 0;
        }
      }
    }
  }
  cout << "No";
  return 0;
}
