Ringo Kingdom Congress is voting on a bill.

N members are present, and the i-th member (1 ≤ i ≤ N) has w_i white ballots and b_i blue ballots. Each member i will put all the w_i white ballots into the box if he/she is in favor of the bill, and put all the b_i blue ballots into the box if he/she is not in favor of the bill. No other action is allowed. For example, a member must not forfeit voting, or put only a part of his/her white ballots or a part of his/her blue ballots into the box.

After all the members vote, if at least P percent of the ballots in the box is white, the bill is passed; if less than P percent of the ballots is white, the bill is rejected.

In order for the bill to pass, at least how many members must be in favor of it?

Constraints

* 1 ≤ N ≤ 10^5
* 1 ≤ P ≤ 100
* 1 ≤ w_i ≤ 10^9
* 1 ≤ b_i ≤ 10^9
* All input values are integers.

Input

Input is given from Standard Input in the following format:


N P
w_1 b_1
w_2 b_2
:
w_N b_N


Output

Print the minimum number of members in favor of the bill required for passage.

Examples

Input

4 75
1 1
1 1
1 1
1 1


Output

3


Input

4 75
1 1
1 1
1 1
100 1


Output

1


Input

5 60
6 3
5 9
3 4
7 8
4 7


Output

3
// Last Update:2017-11-30 22:18:48
// author:sjy
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
LL w[100005],d[100005];
LL c[100005];
int main(void)
{
    int n,p;
    while(scanf("%d %d",&n,&p)!=EOF)
    {  LL sum = 0;
       for(int i = 0;i < n;i++)
           scanf("%lld %lld",&w[i],&d[i]),sum += w[i];
       LL k = p,kk = 100-p;
       sum = kk*sum;
       for(int i = 0;i < n;i++)
           c[i] = k*d[i] + kk*w[i];
       sort(c,c+n);
       int m = 0;
       for(int i = 0;i < n;i++)
       {
         if(sum >= c[i])
             sum -= c[i],m++;
         else break;
       }
       printf("%d\n",n - m);
    }
    return 0;
}