Watering System （贪心）

Arkady wants to water his only flower. Unfortunately, he has a very poor watering system that was designed for nn flowers and so it looks like a pipe with nn holes. Arkady can only use the water that flows from the first hole.

Arkady can block some of the holes, and then pour AA liters of water into the pipe. After that, the water will flow out from the non-blocked holes proportionally to their sizes s1,s2,…,sns1,s2,…,sn. In other words, if the sum of sizes of non-blocked holes is SS, and the ii-th hole is not blocked, si⋅ASsi⋅AS liters of water will flow out of it.

What is the minimum number of holes Arkady should block to make at least BB liters of water flow out of the first hole?

Input

The first line contains three integers nn, AA, BB (1≤n≤1000001≤n≤100000, 1≤B≤A≤1041≤B≤A≤104) — the number of holes, the volume of water Arkady will pour into the system, and the volume he wants to get out of the first hole.

The second line contains nn integers s1,s2,…,sns1,s2,…,sn (1≤si≤1041≤si≤104) — the sizes of the holes.

Output

Print a single integer — the number of holes Arkady should block.

Examples

Input

4 10 3
2 2 2 2

Output

1

Input

4 80 20
3 2 1 4

Output

0

Input

5 10 10
1000 1 1 1 1

Output

4

Note

In the first example Arkady should block at least one hole. After that, 10⋅26≈3.33310⋅26≈3.333liters of water will flow out of the first hole, and that suits Arkady.

In the second example even without blocking any hole, 80⋅310=2480⋅310=24 liters will flow out of the first hole, that is not less than 2020.

In the third example Arkady has to block all holes except the first to make all water flow out of the first hole. 

                               

#include<bits/stdc++.h>
using namespace std;
const int N = 100005;
int arr[N];
int cmp(int a,int b){
	return a>b;
}
int main(){
	int n,A,B;
	scanf("%d%d%d",&n,&A,&B);
	int sum=0;
	for(int i=0;i<n;i++){
	   scanf("%d",&arr[i]);	
	   sum+=arr[i];
	}
    sort(arr+1,arr+n,cmp);
	int ans=0;
    if((A*arr[0]/sum)>=B) ans=0;
    else{
    	for(int i=1;i<n;i++){
    		if((A*arr[0]/sum)>=B) break;
    		sum-=arr[i];
    		ans++;
		}
	}
	printf("%d\n",ans);
	return 0;
}