#include <bits/stdc++.h>
using namespace std;
void solve();
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  cout.precision(2);
  cout << fixed;
  solve();
}
void slv(long long n, long long x1, long long x2,
         vector<pair<long long, long long>> a, bool swp) {
  if (swp) swap(x1, x2);
  vector<long long> res1, res2;
  for (long long i = 0; i < n; ++i) {
    if ((i + 1) * a[i].first >= x1) {
      for (long long j = i + 1; j < n; ++j) {
        if (a[j].first * (j - i) >= x2) {
          for (long long p = 0; p <= i; ++p) res1.push_back(a[p].second);
          for (long long p = i + 1; p <= j; ++p) res2.push_back(a[p].second);
          if (swp) swap(res1, res2);
          cout << "Yes" << '\n';
          cout << res1.size() << ' ' << res2.size() << '\n';
          for (auto p : res1) cout << p + 1 << ' ';
          cout << '\n';
          for (auto p : res2) cout << p + 1 << ' ';
          cout << '\n';
          exit(0);
        }
      }
      return;
    }
  }
  return;
}
void solve() {
  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());
  reverse((a).begin(), (a).end());
  slv(n, x1, x2, a, false);
  slv(n, x1, x2, a, true);
  cout << "No" << '\n';
}
