Problem:
Score : 800 points

Problem Statement

There are N stores called Store 1, Store 2, \cdots, Store N. Takahashi, who is at his house at time 0, is planning to visit some of these stores.

It takes Takahashi one unit of time to travel from his house to one of the stores, or between any two stores.

If Takahashi reaches Store i at time t, he can do shopping there after standing in a queue for a_i \times t + b_i units of time. (We assume that it takes no time other than waiting.)

All the stores close at time T + 0.5. If Takahashi is standing in a queue for some store then, he cannot do shopping there.

Takahashi does not do shopping more than once in the same store.

Find the maximum number of times he can do shopping before time T + 0.5.

Constraints

All values in input are integers.

1 \leq N \leq 2 \times 10^5

0 \leq a_i \leq 10^9

0 \leq b_i \leq 10^9

0 \leq T \leq 10^9

Input

Input is given from Standard Input in the following format:

N T
a_1 b_1
a_2 b_2
\vdots
a_N b_N

Output

Print the answer.

Sample Input 1

3 7
2 0
3 2
0 3

Sample Output 1

2

Here is one possible way to visit stores:

From time 0 to time 1: in 1 unit of time, he travels from his house to Store 1.

From time 1 to time 3: for 2 units of time, he stands in a queue for Store 1 to do shopping.

From time 3 to time 4: in 1 unit of time, he travels from Store 1 to Store 3.

From time 4 to time 7: for 3 units of time, he stands in a queue for Store 3 to do shopping.

In this way, he can do shopping twice before time 7.5.

Sample Input 2

1 3
0 3

Sample Output 2

0

Sample Input 3

5 21600
2 14
3 22
1 3
1 10
1 9

Sample Output 3

5

Sample Input 4

7 57
0 25
3 10
2 4
5 15
3 22
2 14
1 15

Sample Output 4

3

Solution in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long ll;
const int maxStore = 2e5 + 5;
int nbStore, sj, totNeg, totZer;
ll sum[maxStore];
struct STORE {
	ll slope, add;
	STORE operator = (const STORE &d) {
		slope = d.slope;
		add = d.add;
		return (*this);
	}
} store[maxStore], zero[maxStore];
ll dp[maxStore][35];
bool cmp1(STORE fir, STORE sec) {
	return (1ll * sec.slope * (fir.add + 1) < 1ll * fir.slope * (sec.add + 1));
}
bool cmp2(STORE fir, STORE sec) {
	return fir.add < sec.add;
}
int main() {
	scanf("%d%d", &nbStore, &sj);
	for (int i = 1; i <= nbStore; ++i) {
		STORE tmp;
		scanf("%lld%lld", &tmp.slope, &tmp.add);
		if (tmp.slope != 0)
			store[++totNeg] = tmp;
		else zero[++totZer] = tmp;
	}
	sort(store + 1, store + totNeg + 1, cmp1);
	sort(zero + 1, zero + totZer + 1, cmp2);
	for (int i = 1; i <= totZer; ++i)
		sum[i] = sum[i - 1] + zero[i].add + 1;
	memset(dp, 0x3f, sizeof(dp));
	dp[0][0] = 0;
	for (int pre = 1; pre <= totNeg; ++pre) {
		dp[pre][0] = 0;
		//前几个取0个应该都是0 
		for (int chos = 1; chos <= 30; ++chos) {
			dp[pre][chos] = dp[pre - 1][chos];
			if (dp[pre - 1][chos - 1] > 1e9)
				continue ;
			ll tmp = dp[pre - 1][chos - 1] * store[pre].slope + store[pre].add + 1;
			if (tmp > 1e9) continue ;
			else dp[pre][chos] = min(dp[pre][chos], tmp);
		}
	}
	int ans = 0;
	for (int chos = 0; chos <= 30; ++chos) {
		ll spare = sj - dp[totNeg][chos];
		if (spare < 0) break ;
		int pos = upper_bound(sum + 1, sum + totZer + 1, spare) - sum;
		ans = max(chos + pos - 1, ans);
	}
	printf("%d\n", ans);
	return 0;
}