#include <bits/stdc++.h>
using namespace std;
mt19937 rnd(time(0));
const long long inf = 0x3f3f3f3f3f3f3f3fLL;
const long long N = 3e5 + 10;
const long long MOD = 1e9 + 7;
int32_t main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  long long n, x1, x2;
  cin >> n >> x1 >> x2;
  vector<pair<long long, long long>> a(n);
  for (long long i = 0; i < n; i++) {
    cin >> a[i].first;
    a[i].second = i;
  }
  sort(a.begin(), a.end(), greater<pair<long long, long long>>());
  function<pair<vector<long long>, vector<long long>>(long long, long long)>
      solve = [&](long long x1, long long x2) {
        vector<long long> x, y;
        long long c1 = 1;
        while (c1 <= n && x1 > c1 * a[c1 - 1].first) {
          c1++;
        }
        if (c1 >= n) return make_pair(x, y);
        long long c2 = 1;
        while (c1 + c2 <= n && x2 > c2 * a[c1 + c2 - 1].first) {
          c2++;
        }
        if (c1 + c2 >= n + 1) return make_pair(x, y);
        for (long long i = 0; i < c1; i++) x.push_back(a[i].second + 1);
        for (long long i = c1; i < c1 + c2; i++) y.push_back(a[i].second + 1);
        sort(x.begin(), x.end());
        sort(y.begin(), y.end());
        return make_pair(x, y);
      };
  auto res = solve(x1, x2);
  if (!res.first.empty()) {
    cout << "Yes" << '\n';
    cout << (long long)res.first.size() << ' ' << (long long)res.second.size()
         << '\n';
    for (auto i : res.first) cout << i << ' ';
    cout << '\n';
    for (auto i : res.second) cout << i << ' ';
    cout << '\n';
    return 0;
  }
  res = solve(x2, x1);
  if (!res.first.empty()) {
    cout << "Yes" << '\n';
    swap(res.first, res.second);
    cout << (long long)res.first.size() << ' ' << (long long)res.second.size()
         << '\n';
    for (auto i : res.first) cout << i << ' ';
    cout << '\n';
    for (auto i : res.second) cout << i << ' ';
    cout << '\n';
    return 0;
  }
  cout << "No" << '\n';
  return 0;
}
