#include <bits/stdc++.h>
using namespace std;
const long double pi = 3.14159265358979323;
const double EPS = 1e-12;
const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
std::vector<pair<long long int, long long int> > v;
std::vector<long long int> now[N], extra;
map<long long int, long long int> mp;
void clear() {
  v.clear();
  for (int i = 0; i < N; i++) now[i].clear();
  extra.clear();
  mp.clear();
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int n, x, xx, y;
  cin >> n >> x >> xx;
  for (int i = 0; i < n; i++) {
    cin >> y;
    v.push_back({y, i});
  }
  sort(v.begin(), v.end());
  for (int i = 1; i <= n; i++) {
    long long int t = xx / i;
    if (xx % i) t++;
    long long int lo = -1, hi = n, mid;
    while (hi - lo > 1) {
      mid = hi + lo >> 1LL;
      if ((v[mid].first < t) || (n - mid < i))
        lo = mid;
      else
        hi = mid;
    }
    if (v[hi].first < t || hi == n) continue;
    now[hi].push_back(i);
    if (mp.count(hi)) continue;
    extra.push_back(hi);
    mp[hi]++;
  }
  sort(extra.begin(), extra.end());
  for (int i = 1; i <= n; i++) {
    long long int t = x / i;
    if (x % i) t++;
    long long int lo = -1, hi = n, mid;
    while (hi - lo > 1) {
      mid = hi + lo >> 1LL;
      if (v[mid].first >= t)
        hi = mid;
      else
        lo = mid;
    }
    long long int pos =
        lower_bound(extra.begin(), extra.end(), hi + i) - extra.begin();
    if (pos != (int)extra.size()) {
      cout << "Yes\n";
      cout << i << " " << now[extra[pos]][0] << "\n";
      for (int j = hi; j < hi + i; j++) cout << v[j].second + 1 << " ";
      cout << "\n";
      for (int j = extra[pos]; j < extra[pos] + now[extra[pos]][0]; j++)
        cout << v[j].second + 1 << " ";
      return 0;
    }
  }
  clear();
  for (int i = 1; i <= n; i++) {
    long long int t = x / i;
    if (x % i) t++;
    long long int lo = -1, hi = n, mid;
    while (hi - lo > 1) {
      mid = hi + lo >> 1LL;
      if ((v[mid].first < t) || (n - mid < i))
        lo = mid;
      else
        hi = mid;
    }
    if (v[hi].first < t || hi == n) continue;
    now[hi].push_back(i);
    if (mp.count(hi)) continue;
    extra.push_back(hi);
    mp[hi]++;
  }
  sort(extra.begin(), extra.end());
  for (int i = 1; i <= n; i++) {
    long long int t = xx / i;
    if (xx % i) t++;
    long long int lo = -1, hi = n, mid;
    while (hi - lo > 1) {
      mid = hi + lo >> 1LL;
      if (v[mid].first >= t)
        hi = mid;
      else
        lo = mid;
    }
    long long int pos =
        lower_bound(extra.begin(), extra.end(), hi + i) - extra.begin();
    if (pos != (int)extra.size()) {
      cout << "Yes\n";
      cout << now[extra[pos]][0] << " " << i << "\n";
      for (int j = extra[pos]; j < extra[pos] + now[extra[pos]][0]; j++)
        cout << v[j].second + 1 << " ";
      cout << "\n";
      for (int j = hi; j < hi + i; j++) cout << v[j].second + 1 << " ";
      return 0;
    }
  }
  cout << "No";
  return 0;
}
