#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll N = 1e6;
ll n, first, second;
pair<ll, ll> a[N];
signed main() {
  ios::sync_with_stdio(0), cin.tie(0);
  cin >> n >> first >> second;
  for (ll i = 0; i < n; ++i) {
    cin >> a[i].first;
    a[i].second = i + 1;
  }
  sort(a, a + n);
  ll fi = -1, se = -1;
  for (ll i = 0; i < n; ++i) {
    ll area = (n - i) * a[i].first;
    if (area >= second) {
      se = i;
    }
  }
  if (se != -1) {
    for (ll i = 0; i < se; ++i) {
      ll area = (se - i) * a[i].first;
      if (area >= first) {
        fi = i;
      }
    }
    if (fi != -1) {
      cout << "Yes\n";
      cout << se - fi << " " << n - se << "\n";
      for (ll i = fi; i < se; ++i) {
        cout << a[i].second << " ";
      }
      cout << "\n";
      for (ll i = se; i < n; ++i) {
        cout << a[i].second << " ";
      }
      cout << "\n";
      return 0;
    }
  }
  fi = -1, se = -1;
  swap(first, second);
  for (ll i = 0; i < n; ++i) {
    ll area = (n - i) * a[i].first;
    if (area >= second) {
      se = i;
    }
  }
  if (se != -1) {
    for (ll i = 0; i < se; ++i) {
      ll area = (se - i) * a[i].first;
      if (area >= first) {
        fi = i;
      }
    }
    if (fi != -1) {
      cout << "Yes\n";
      cout << n - se << " " << se - fi << "\n";
      for (ll i = se; i < n; ++i) {
        cout << a[i].second << " ";
      }
      cout << "\n";
      for (ll i = fi; i < se; ++i) {
        cout << a[i].second << " ";
      }
      cout << "\n";
      return 0;
    }
  }
  cout << "No\n";
  return 0;
}
