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
#include <iostream>
#include <vector>
#include <algorithm>

#define ll long long
using namespace std;

int main() {
    ll n, p;
    cin >> n >> p;
    ll bsum = 0;
    vector<vector<ll>> x(n, vector<ll>(3));
    for (int i = 0; i < n; i++) {
        cin >> x[i][1] >> x[i][2];
        bsum += x[i][2];
        x[i][0] = x[i][1] * (100 - p) + x[i][2] * p;
    }
    sort(x.begin(), x.end());
    reverse(x.begin(), x.end());
    int ret = 0;
    ll wsum = 0;
    while (true) {
        bsum -= x[ret][2];
        wsum += x[ret][1];
        ret++;
        if (wsum * 100 >= p * (wsum + bsum))break;
    }
    cout << ret << endl;

    /*vector<vector<ll>> dp(n + 1, vector<ll>(2));//w and all
    for (int i = 1; i <= n; i++)dp[i][1] = 1145141919810;
    for (int i = 0; i < n; i++) {
        int w, b;
        cin >> w >> b;
        for (int j = i + 1; j >= 0; j--) {
            if (j > 0 && dp[j][0] * (dp[j - 1][1] + w)
                         < (dp[j - 1][0] + w) * (dp[j][1] + b)) {
                dp[j][0] = dp[j - 1][0] + w;
                dp[j][1] = dp[j - 1][1] + w;
            } else dp[j][1] += b;
        }
    }
    for (int i = 1; true; i++) {
        if (dp[i][0] * 100 >= p * dp[i][1]) {
            cout << i << endl;
            break;
        }
    }*/
    return 0;
}