#include <bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pli = pair<ll, int>;
using pil = pair<int, ll>;
using pll = pair<ll, ll>;
template <typename T>
using vec = vector<T>;
using vi = vec<int>;
using vl = vec<ll>;
template <typename T>
using que = queue<T>;
template <typename T>
using deq = deque<T>;
template <typename T>
T id(T b) {
  return b;
};
template <typename T>
void chmax(T &x, T y) {
  if (x < y) x = y;
}
template <typename T>
void chmin(T &x, T y) {
  if (x > y) x = y;
}
template <typename S, typename K>
bool contains(S &s, K k) {
  return s.find(k) != s.end();
}
void fastio() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
}
constexpr ll TEN(int n) {
  if (n == 0)
    return 1LL;
  else
    return 10LL * TEN(n - 1);
}
const int MAX_N = 300000;
int n, x1, x2;
pii c[MAX_N];
vi v1, v2;
bool calc(int x1, int x2) {
  int k = 0;
  int i = n - 1;
  for (; i >= 0; i--) {
    k++;
    v1.push_back(c[i].second);
    if (c[i].first * k >= x1) {
      i--;
      break;
    }
  }
  k = 0;
  bool ok = false;
  for (; i >= 0; i--) {
    k++;
    v2.push_back(c[i].second);
    if (c[i].first * k >= x2) {
      ok = true;
      break;
    }
  }
  return ok;
}
void pv(vi &v) {
  for (int x : v) {
    cout << x << ' ';
  }
  cout << endl;
}
int main() {
  fastio();
  cin >> n >> x1 >> x2;
  for (int i = 0; i < int(n); i++) {
    cin >> c[i].first;
    c[i].second = i + 1;
  }
  sort(c, c + n);
  if (calc(x1, x2)) {
    cout << "Yes\n";
    cout << v1.size() << " " << v2.size() << "\n";
    pv(v1);
    pv(v2);
    return 0;
  }
  v1.clear();
  v2.clear();
  if (calc(x2, x1)) {
    cout << "Yes\n";
    cout << v2.size() << " " << v1.size() << "\n";
    pv(v2);
    pv(v1);
    return 0;
  }
  cout << "No\n";
  return 0;
}
