#define _CRT_SECURE_NO_WARNINGS
#pragma target("avx")
#pragma optimize("O3")
#pragma optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define REP(i,n) for(int i=1;i<=(int)(n);i++)
#define all(V) V.begin(),V.end()
typedef long long lint;
typedef std::pair<lint, lint> P;
constexpr int INF = INT_MAX/2;
constexpr lint LINF = LLONG_MAX/2;
constexpr double eps = 1e-9;
template<class T>
class prique :public std::priority_queue<T, std::vector<T>, std::greater<T>> {};
template <class T, class U>
inline bool chmax(T& lhs, const U& rhs) {
	if (lhs < rhs) {
		lhs = rhs;
		return 1;
	}
	return 0;
}
template <class T, class U>
inline bool chmin(T& lhs, const U& rhs) {
	if (lhs > rhs) {
		lhs = rhs;
		return 1;
	}
	return 0;
}
inline lint gcd(lint a, lint b) {
	while (b) {
		lint c = a;
		a = b; b = c % b;
	}
	return a;
}
inline lint lcm(lint a, lint b) {
	return a / gcd(a, b) * b;
}
bool isprime(lint n) {
	if (n == 1)return false;
	for (int i = 2; i * i <= n; i++) {
		if (n % i == 0)return false;
	}
	return true;
}
lint mypow(lint a, lint b) {
	if (!b)return 1;
	if (b & 1)return mypow(a, b - 1) * a;
	lint memo = mypow(a, b >> 1);
	return memo * memo;
}
lint modpow(lint a, lint b, lint m) {
	if (!b)return 1;
	if (b & 1)return modpow(a, b - 1, m) * a % m;
	lint memo = modpow(a, b >> 1, m);
	return memo * memo % m;
}
template<typename T>
void printArray(std::vector<T>& vec) {
	rep(i, vec.size() - 1)std::cout << vec[i] << " ";
	std::cout << vec.back() << std::endl;
}
template<typename T>
void printArray(T l, T r) {
	T rprev = r;
	rprev--;
	for (T i = l; i != rprev; i++) {
		std::cout << *i << " ";
	}
	std::cout << *rprev << std::endl;
}
std::string to_string(std::vector<int>& vec) {
	std::string res = "[";
	rep(i, vec.size() - 1)res += std::to_string(vec[i]) + ", ";
	res += std::to_string(vec.back()) + "]";
	return res;
}
int n,t;
std::vector<P> vec;
std::vector<lint> zerovec;
bool func(const P& lhs,const P& rhs){
	return lhs.first*(rhs.second+1)>rhs.first*(lhs.second+1);
}
lint dp[200010][35];
int main(){
	std::cin>>n>>t;
	rep(i,n){
		int a,b;
		std::cin>>a>>b;
		if(a)vec.emplace_back(a,b);
		else zerovec.emplace_back(b);
	}
	std::sort(all(vec),func);
	std::sort(all(zerovec));
	rep(i,zerovec.size()-1){
		zerovec[i]++;
		zerovec[i+1]+=zerovec[i];
	}
	if(!zerovec.empty())zerovec.back()++;
	rep(i,vec.size()+1){
		rep(j,35)dp[i][j]=LINF;
	}
	dp[0][0]=0;
	int ans=0;
	rep(i,vec.size()){
		rep(j,35){
			if(dp[i][j]==LINF)continue;
			int a=vec[i].first,b=vec[i].second;
			chmax(ans,j+std::upper_bound(all(zerovec),t-dp[i][j])-zerovec.begin());
			chmin(dp[i+1][j],dp[i][j]);
			if((dp[i][j]+1)*(a+1)+b<=t){
				chmin(dp[i+1][j+1],(dp[i][j]+1)*(a+1)+b);
			}
		}
	}
	rep(i,35){
		if(dp[vec.size()][i]!=LINF)chmax(ans,i+std::upper_bound(all(zerovec),t-dp[vec.size()][i])-zerovec.begin());
	}
	std::cout<<ans<<std::endl;
	return 0;
}

Measured memory_bytes: 58476