//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#pragma warning(disable:4786)
#pragma warning(disable:4996)
#include <ctime>
#include<list>
#include <numeric>
#include<bitset>
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<functional>
#include<string>
#include<cstring>
#include<cstdlib>
#include<queue>
#include<utility>
#include<fstream>
#include<sstream>
#include<cmath>
#include<stack>
#include<assert.h>
#include<unordered_map>
#include<unordered_set>
#include <array>
using namespace std;

#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
	~debug() { cerr << endl; }
	template<class c> typename enable_if<sizeof dud<c>(0) != 1, debug&>::type operator<<(c i) {
		cerr << boolalpha << i; return *this;
	}

	template<class c, int = 0> typename enable_if<sizeof dud<c>(0) == 1, debug&>::type operator<<(c i) {
		return *this << range(begin(i), end(i));
	}

	sim, class b dor(pair < b, c > d) {
		ris << "(" << d.first << ", " << d.second << ")";
	}
	sim dor(rge<c> d) {
		*this << "[";
		for (auto it = d.b; it != d.e; ++it)
			*this << ", " + 2 * (it == d.b) << *it;
		ris << "]";
	}
#else
	sim dor(const c&) { ris; }
#endif
};
#define watch(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

#define MEM(a, b) memset(a, (b), sizeof(a))
#define CLR(a) memset(a, 0, sizeof(a))
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define ABS(X) ( (X) > 0 ? (X) : ( -(X) ) )
#define S(X) ( (X) * (X) )
#define SZ(V) (int )V.size()
#define FORN(i, n) for(int i = 0; i < n; i++)
#define FORAB(i, a, b) for(int i = a; i <= b; i++)
#define ALL(V) V.begin(), V.end()
#define IN(A, B, C)  ((B) <= (A) && (A) <= (C))
#define AIN(A, B, C) assert(IN(A, B, C))

//typedef int LL;
typedef long long int LL;
//typedef __int128 LLL;
typedef long long LLL;

typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<double, double> PDD;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PLL > VPL;
typedef vector<PII > VP;
typedef vector<double> VD;
typedef vector<vector<int>> VVI;
typedef vector<string> VS;
typedef long double ld;

#define MAXN 100005
//const LL MOD = 1000000007;
const LL MOD = 998244353;
const LL INF = 2000000000000000001LL;

struct Shop {
	LL a, b;
};
vector<Shop> shops;
vector<int> extra;

bool operator<(Shop I, Shop J) {
	return J.a * I.b + J.a < I.a * J.b + I.a;
}
LL dp[2][40];

void solve(int ks) {
	int n;
	LL T;
	scanf("%d %lld", &n, &T);
	shops.reserve(200000);
	for (int i = 0; i < n; i++) {
		Shop s;
		scanf("%lld %lld", &s.a, &s.b);
		if (s.a == 0) {
			extra.push_back(s.b);
		}
		else {
			shops.push_back(s);
		}
	}
	sort(ALL(shops));
	sort(ALL(extra));

	dp[0][0] = 0;
	for (int i = 1; i < 40; i++) dp[0][i] = -1;
	int u = 0, v = 1;
	for (int i = 0; i < SZ(shops); i++) {
		for (int j = 0; j < 40; j++) dp[v][j] = dp[u][j];
		for (int j = 38; j >= 0; j--) {
			if (dp[u][j] == -1) continue;
			LL tt = dp[u][j] + 1;
			LL nxt = tt + shops[i].a * tt + shops[i].b;
			if (dp[v][j + 1] == -1 || dp[v][j + 1] > nxt) dp[v][j + 1] = nxt;
		}
		for (int j = 0; j < 40; j++) if (dp[v][j] > T) dp[v][j] = -1;
		swap(u, v);
	}
	int ans = 0;
	for (int i = 0; i < 40; i++) {
		if (dp[u][i] == -1 || dp[u][i] > T) continue;
		int now = i;
		LL cur = dp[u][i];
		int k = 0;
		while (k < SZ(extra)) {
			if (cur + extra[k] + 1<= T) {
				cur += extra[k] + 1;
				now++;
				k++;
			}
			else {
				break;
			}
		}
		ans = MAX(ans, now);
	}
	printf("%d\n", ans);

}

void gen() {
}

int main()
{
	double start_time = clock();
#ifdef LOCAL
	freopen("C:\\Home\\ContestCodes\\sample.in", "r", stdin);
	//	freopen("out.out", "w", stdout);
#endif

	gen();

	if (0) {
		int T;
		scanf("%d", &T);
		AIN(T, 1, 5000);
		for (int ks = 1; ks <= T; ks++) {
			solve(ks);
			//fprintf(stderr, "%d done\n", ks);
		}
	}
	else {
		solve(0);
	}

	double end_time = clock();
	fprintf(stderr, "Time = %lf\n", (end_time - start_time) / CLOCKS_PER_SEC);

	return 0;
}


Measured memory_bytes: 3580