#include <bits/stdc++.h>
using namespace std;
void merge(int arr[], int left, int mid, int right) {
  int temp[right - left + 1];
  int i = left;
  int j = mid + 1;
  int k = 0;
  while (i <= mid && j <= right) {
    if (arr[i] <= arr[j])
      temp[k++] = arr[i++];
    else
      temp[k++] = arr[j++];
  }
  while (i <= mid) temp[k++] = arr[i++];
  while (j <= right) temp[k++] = arr[j++];
  for (int p = 0; p < k; p++) arr[left + p] = temp[p];
}
void mergeSort(int arr[], int left, int right) {
  if (left >= right) return;
  int mid = (right + left) / 2;
  mergeSort(arr, left, mid);
  mergeSort(arr, mid + 1, right);
  merge(arr, left, mid, right);
}
int main() {
  int n;
  int A, B;
  cin >> n >> A >> B;
  int s[n], s1[n - 1];
  for (int i = 0; i < n; i++) {
    cin >> s[i];
    if (i) s1[i - 1] = s[i];
  }
  int count = 1;
  int S = s[0];
  int isB = s[0] * A;
  mergeSort(s1, 0, n - 2);
  for (int j = 1; j < n; j++) {
    S += s1[j - 1];
    if (isB / S >= B) {
      count++;
    }
  }
  cout << n - count << endl;
  return 0;
}
