#include <bits/stdc++.h>
const double eps = 1e-10;
const float epsf = 1e-6;
using namespace std;
inline long long int __gcd(long long int a, long long int b) {
  if (a == 0 || b == 0) {
    return max(a, b);
  }
  long long int tempa, tempb;
  while (1) {
    if (a % b == 0)
      return b;
    else {
      tempa = a;
      tempb = b;
      a = tempb;
      b = tempa % tempb;
    }
  }
}
inline int compfloat(float& x, float& y) {
  if (fabs(x - y) < epsf)
    return 0;
  else if (x - y > 0)
    return 1;
  return -1;
}
inline int compdouble(double x, double y) {
  if (fabs(x - y) < eps)
    return 0;
  else if (x - y > 0)
    return 1;
  else
    return -1;
}
bool prime(long long int k) {
  for (long long int i = 2; i * i <= k; i++)
    if (k % i == 0) {
      return false;
    }
  return true;
}
void pdash(int n = 1) {
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < 30; j++) {
      cout << "-";
    }
    cout << "\n";
  }
}
long long int n, x1, x2;
void solve() {
  long long int n, x1, x2;
  cin >> n >> x1 >> x2;
  pair<long long int, int> arr[n];
  for (int i = 0; i < n; i++) {
    cin >> arr[i].first;
    arr[i].second = i + 1;
  }
  sort(arr, arr + n);
  for (long long int k = 1; k <= n; k++) {
    long long int p1 = (arr[n - k].first);
    long long int k1 = (x1 + p1 - 1) / p1;
    long long int k2 = k - k1;
    if (k2 >= 1 && arr[n - k2].first >= (x2 + k2 - 1) / k2) {
      cout << "Yes\n";
      cout << k1 << " " << k2 << "\n";
      for (long long int i = k2 + 1; i <= k; i++)
        cout << arr[n - i].second << " ";
      cout << "\n";
      for (int i = 1; i <= k2; i++) {
        cout << arr[n - i].second << " ";
      }
      cout << "\n";
      return;
    }
    k2 = (x2 + p1 - 1) / p1;
    k1 = k - k2;
    if (k1 >= 1 && arr[n - k1].first >= (x1 + k1 - 1) / k1) {
      cout << "Yes\n";
      cout << k1 << " " << k2 << "\n";
      for (int i = 1; i <= k1; i++) {
        cout << arr[n - i].second << " ";
      }
      cout << "\n";
      for (long long int i = k1 + 1; i <= k; i++) {
        cout << arr[n - i].second << " ";
      }
      cout << "\n";
      return;
    }
  }
  cout << "No\n";
  return;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t--) {
    solve();
  }
}
