#include <bits/stdc++.h>
using namespace std;
long long n, a, b, lea, mx[300100], pos[300100];
pair<long long, long long> num[300100];
int main() {
  long long i, j, k;
  cin >> n >> a >> b;
  for (i = 1; i <= n; i++) {
    scanf("%lld", &num[i].first);
    num[i].second = i;
  }
  sort(num + 1, num + n + 1);
  for (i = n; i >= 1; i--) {
    if ((n - i + 1) * num[i].first >= b) break;
  }
  lea = i;
  for (i = 1; i <= n; i++) {
    k = (n - i + 1) - (b + num[i].first - 1) / num[i].first;
    if (k > mx[i - 1]) {
      mx[i] = k;
      pos[i] = i;
    } else
      mx[i] = mx[i - 1], pos[i] = pos[i - 1];
  }
  for (i = n; i >= 1; i--) {
    if ((a + num[i].first - 1) / num[i].first > (n - i + 1)) continue;
    k = (a + num[i].first - 1) / num[i].first + i - 1;
    if (k < lea) {
      puts("Yes");
      printf("%lld %lld\n", k - i + 1, n - lea + 1);
      for (j = i; j <= k; j++) printf("%lld ", num[j].second);
      puts("");
      for (j = lea; j <= n; j++) printf("%lld ", num[j].second);
      return 0;
    }
    if (mx[i - 1] >= k - i + 1) {
      puts("Yes");
      printf("%lld %lld\n", k - i + 1, n - pos[i] + 1 - (k - i + 1));
      for (j = i; j <= k; j++) printf("%lld ", num[j].second);
      puts("");
      for (j = pos[i - 1]; j <= n; j++)
        if (j < i || j > k) printf("%lld ", num[j].second);
      return 0;
    }
  }
  puts("No");
}
