#include <bits/stdc++.h>
using namespace std;
typedef priority_queue<pair<int, int>, vector<pair<int, int>>,
                       greater<pair<int, int>>>
    rpqpi;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n, j = 0, jj;
  long long x1, x2;
  cin >> n >> x1 >> x2;
  vector<pair<long long, int>> c(n);
  for (int i = 0; i < n; ++i) {
    cin >> c[i].first;
    c[i].second = i + 1;
  }
  sort(c.rbegin(), c.rend());
  long long sum1 = 0, sum2 = 0;
  while (j < n && sum1 < x1) {
    sum1 = c[j].first * (j + 1);
    jj = j;
    ++j;
  }
  while (j < n && sum2 < x2) {
    sum2 = c[j].first * (j - jj);
    ++j;
  }
  if (sum2 < x2) {
    j = 0;
    long long sum1 = 0, sum2 = 0;
    while (j < n && sum2 < x2) {
      sum2 = c[j].first * (j + 1);
      jj = j;
      ++j;
    }
    while (j < n && sum1 < x1) {
      sum1 = c[j].first * (j - jj);
      ++j;
    }
    if (sum1 < x1) {
      cout << "No\n";
    } else {
      cout << "Yes\n";
      cout << j - 1 - jj << " " << jj + 1 << '\n';
      for (int i = jj + 1; i < j; ++i) {
        cout << c[i].second << " ";
      }
      cout << '\n';
      for (int i = 0; i < jj + 1; ++i) {
        cout << c[i].second << " ";
      }
      cout << '\n';
    }
  } else {
    cout << "Yes\n";
    cout << jj + 1 << " " << j - jj - 1 << '\n';
    for (int i = 0; i < jj + 1; ++i) {
      cout << c[i].second << " ";
    }
    cout << '\n';
    for (int i = jj + 1; i < j; ++i) {
      cout << c[i].second << " ";
    }
    cout << '\n';
  }
  return 0;
}
