#include <bits/stdc++.h>
using namespace std;
int n, A, B;
int main() {
  cin >> n >> A >> B;
  vector<int> v(n);
  int S = 0;
  for (int i = 0; i < n; ++i) {
    cin >> v[i];
    S += v[i];
  }
  sort(v.begin() + 1, v.end());
  int b = v[0] * A / S;
  int count = 0;
  int idx = n - 1;
  while (b < B && n != 0) {
    S -= v[idx];
    b = v[0] * A / S;
    --idx;
    ++count;
  }
  cout << count << endl;
  return 0;
}
