#include <bits/stdc++.h>
using namespace std;
pair<long long, long long> a[350001];
long long n, i, j, abcd, x2, nom;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> abcd >> x2;
  for (i = 1; i <= n; i++) {
    cin >> a[i].first;
    a[i].second = i;
  }
  sort(a + 1, a + 1 + n);
  for (i = n; i >= 1; i--)
    if ((x2 + a[i].first - 1) / a[i].first <= n - i + 1) {
      nom = i;
      break;
    }
  if (nom != 0) {
    for (i = 1; i <= n; i++)
      if (i + (abcd + a[i].first - 1) / a[i].first - 1 < nom) {
        cout << "Yes" << '\n';
        cout << (abcd + a[i].first - 1) / a[i].first << " "
             << (x2 + a[nom].first - 1) / a[nom].first << '\n';
        for (j = i; j <= i + (abcd + a[i].first - 1) / a[i].first - 1; j++)
          cout << a[j].second << " ";
        cout << '\n';
        for (j = nom; j <= nom + (x2 + a[nom].first - 1) / a[nom].first - 1;
             j++)
          cout << a[j].second << " ";
        cout << '\n';
        return 0;
      }
  }
  nom = 0;
  for (i = n; i >= 1; i--)
    if ((abcd + a[i].first - 1) / a[i].first <= n - i + 1) {
      nom = i;
      break;
    }
  if (nom != 0) {
    for (i = 1; i <= n; i++)
      if (i + (x2 + a[i].first - 1) / a[i].first - 1 < nom) {
        cout << "Yes" << '\n';
        cout << (abcd + a[nom].first - 1) / a[nom].first << " "
             << (x2 + a[i].first - 1) / a[i].first << '\n';
        for (j = nom; j <= nom + (abcd + a[nom].first - 1) / a[nom].first - 1;
             j++)
          cout << a[j].second << " ";
        cout << '\n';
        for (j = i; j <= i + (x2 + a[i].first - 1) / a[i].first - 1; j++)
          cout << a[j].second << " ";
        cout << '\n';
        return 0;
      }
  }
  cout << "No" << '\n';
  return 0;
}
