#include <bits/stdc++.h>
inline long long int no_of_digits(long long int n) {
  return 1 + floor(log10(n));
}
using namespace std;
int main() {
  long long int i, j, a, b, k, m, n, q, t, count1 = 1, count2, temp1, temp2,
                                           sum = 0;
  cin >> n >> a >> b;
  vector<int> v;
  for (i = 0; i < n; i++) {
    cin >> k;
    if (i == 0)
      temp1 = k;
    else
      v.push_back(k);
  }
  temp2 = ((temp1 * a) / b) - temp1;
  sort(v.begin(), v.end());
  i = 0;
  while (i < n - 1 and sum + v[i] <= temp2) {
    sum = sum + v[i];
    count1++;
    i++;
  }
  if (i == n - 1)
    cout << 0;
  else
    cout << n - count1;
  return 0;
}
