#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 7;
const long long mod = 1e9;
char s1[15];
double qq[1050000];
int main() {
  int i, j;
  int T, t2, t3, t4, f1, f2, f3, f4;
  int r, c;
  int n;
  double t1, k;
  double g1, g2, g3, g4, g5;
  int b1, b2, b3, b4;
  double m;
  cin >> n >> m >> k;
  double sum = 0;
  for (i = 1; i <= n; i++) {
    cin >> qq[i];
    sum += qq[i];
  }
  if (m * qq[1] / sum >= k) {
    cout << "0" << endl;
    return 0;
  }
  sort(qq + 2, qq + n + 1);
  for (i = n; i >= 2; i--) {
    sum -= qq[i];
    if (m * qq[1] / sum >= k) {
      cout << n - i + 1 << endl;
      return 0;
    }
  }
  return 0;
}
