#include <bits/stdc++.h>
using namespace std;
void Run() {
  int n, x[2];
  cin >> n >> x[0] >> x[1];
  vector<pair<int, int> > c(n);
  for (int i = 0; i < n; ++i) {
    cin >> c[i].first;
    c[i].second = i + 1;
  }
  sort(c.begin(), c.end());
  for (int it = 0; it < 2; ++it) {
    int split = -1;
    for (int i = n - 1; i >= 0; --i) {
      if ((long long)x[it ^ 1] <= 1LL * (n - i) * c[i].first) {
        split = i;
        break;
      }
    }
    if (split == -1) {
      continue;
    }
    for (int j = 0; j < split; ++j) {
      int k = (x[it] + c[j].first - 1) / c[j].first;
      if (j + k - 1 >= split) {
        continue;
      } else {
        cout << "Yes\n";
        vector<int> a, b;
        for (int i = j; i < j + k; ++i) a.push_back(c[i].second);
        for (int i = split; i < n; ++i) b.push_back(c[i].second);
        if (it) {
          a.swap(b);
        }
        cout << a.size() << ' ' << b.size() << '\n';
        for (int x : a) cout << x << ' ';
        cout << '\n';
        for (int x : b) cout << x << ' ';
        cout << '\n';
        return;
      }
    }
  }
  cout << "No\n";
}
int main() {
  srand(time(0));
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  Run();
  return 0;
}
