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 <bits/stdc++.h>


using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0; i<int(n); i++)
#define FOR(i,m,n) for(int i=int(m); i<int(n); i++)
#define ALL(obj) (obj).begin(),(obj).end()
#define VI vector<int>
#define VLL vector<long long>
#define VVI vector<vector<int>>
#define VVLL vector<vector<long long>>
#define VC vector<char>
#define VS vector<string>
#define VVC vector<vector<char>>
#define fore(i,a) for(auto &i:a)

typedef pair <int, int> P;
template<class T> bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; }
const int  INF = 1 << 30;
const ll INFL = 1LL<<60;
const ll mod =1000000009;





int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	int n;
	ll p;
	cin >> n >> p;

	ll c = 0, d = 0;


	vector<ll> w(n), b(n);
	vector<pair<ll, pair<ll, ll>>> v;
	ll sum = 0;
	ll a = 0;
	REP(i, n) {
		cin >> w[i] >> b[i];
		v.push_back({ (100 - p)*w[i] + p * b[i],{w[i],b[i]} });
		sum += b[i];
	}
	sort(ALL(v));
	reverse(ALL(v));

	int ans = 0;

	REP(i, n) {
		a += v[i].second.first;
		sum -= v[i].second.second;
		ans++;
		if ((100 - p)*a >= p * sum)break;

	}

	cout << ans << endl;


	return 0;
}