#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#include <bits/stdc++.h>
using namespace std;
template<class t> inline t read(t &x){
	char c=getchar();bool f=0;x=0;
	while(!isdigit(c)) f|=c=='-',c=getchar();
	while(isdigit(c)) x=(x<<1)+(x<<3)+(c^48),c=getchar();
	if(f) x=-x;return x;
}
template<class t,class ...A> inline void read(t &x,A &...a){
	read(x);read(a...);
}
template<class t> inline void write(t x){
	if(x<0) putchar('-'),write(-x);
	else{if(x>9) write(x/10);putchar('0'+x%10);}
}

#define int long long

const int N=2e5+5;
int a[N],b[N],nm,n,m,ans,p[N],f[N][35],sum[N];
double val[N];

bool cmp(int x,int y){
	return val[x]<val[y];
}

signed main(){
	read(n,m);
	for(int i=1;i<=n;i++) read(a[i],b[i]),p[i]=i,val[i]=a[i]?1.0*(b[i]+1)/a[i]:1e15;
	sort(p+1,p+1+n,cmp);
	for(int i=0;i<=n;i++) for(int j=1;j<=30;j++) f[i][j]=m+1;
	for(int i=1;i<=n;i++){
		int x=p[i];
		if(!a[x]){
			sum[++nm]=b[x]+1;
			continue;
		}
		for(int j=1;j<=30&&j<=i;j++) f[i][j]=min(f[i-1][j],f[i-1][j-1]+1+(f[i-1][j-1]*a[x]+a[x]+b[x]));
	}
	sort(sum+1,sum+1+nm);
	for(int i=1;i<=nm;i++) sum[i]+=sum[i-1];
	for(int i=0;i<=nm;i++) for(int j=0;j<=30&&j<=n;j++) if(f[n-nm][j]+sum[i]<=m) ans=max(ans,j+i); else break;
	write(ans);
}