#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int> > v;
bool yes;
int n, x, y;
void solve(bool xy) {
  if (yes) return;
  const long long a = xy ? x : y;
  const long long b = xy ? y : x;
  int count = 0;
  int k = ((int)(v).size()) - 1;
  long long p = 0, q = 0;
  while (k >= 0) {
    ++p;
    long long e = v[k--].first;
    if (p * e >= a) {
      ++count;
      break;
    }
  }
  while (k >= 0) {
    ++q;
    long long e = v[k--].first;
    if (q * e >= b) {
      ++count;
      break;
    }
  }
  if (count == 2) {
    printf("Yes\n");
    if (xy) {
      printf("%I64d %I64d\n", p, q);
      const int m = ((int)(v).size()) - 1;
      for (int i = 0; i < p; ++i) {
        printf("%d ", v[m - i].second);
      }
      printf("\n");
      for (int i = 0; i < q; ++i) {
        printf("%d ", v[m - p - i].second);
      }
      printf("\n");
    } else {
      printf("%I64d %I64d\n", q, p);
      const int m = ((int)(v).size()) - 1;
      for (int i = 0; i < q; ++i) {
        printf("%d ", v[m - p - i].second);
      }
      printf("\n");
      for (int i = 0; i < p; ++i) {
        printf("%d ", v[m - i].second);
      }
      printf("\n");
    }
    yes = 1;
  }
}
int main() {
  scanf("%d%d%d", &n, &x, &y);
  int w;
  for (int i = (1); i <= (n); ++i) {
    scanf("%d", &w);
    v.push_back({w, i});
  }
  sort((v).begin(), (v).end());
  yes = false;
  solve(1);
  solve(0);
  if (!yes) printf("No\n");
  return 0;
}
