#include<bits/stdc++.h>
using namespace std;

#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9+7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T>
bool chmin(T &a,T b){if(a>b){a=b;return true;}else return false;}
template<typename T>
bool chmax(T &a,T b){if(a<b){a=b;return true;}else return false;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>
void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T>
void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++)
{for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
template<typename T>
void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];
for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
template<typename T>
vector<vector<T>>vec(ll x, ll y, T w){
  vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,0,-1,0,1,1,-1,-1};
vector<ll>dy={0,1,0,-1,1,-1,1,-1};
template<typename T>
vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v(ts...))>(a,make_v(ts...));
}
ostream &operator<<(ostream &os, pair<ll, ll>&p){
  return os << p.first << " " << p.second;
}  
struct RationalNumber{
  long long a, b;
  RationalNumber(){
    a = 0,b = 1;
  }
  RationalNumber(long long p, long long q):a(p), b(q){// a / b
  };
  void reduction(){
    long long g = __gcd(a, b);
    a /= g, b /= g;
  }
  RationalNumber &operator+=(const RationalNumber &x){
    long long q = b / __gcd(b, x.b) * x.b;
    a = a * q / b + x.a * q / x.b;
    b = q;
    reduction();
    return *this;
  }
  RationalNumber &operator-=(const RationalNumber &x){
    long long q = b / __gcd(b, x.b) * x.b;
    a = a * q / b + x.a * q / x.b;
    b = q;
    reduction();
    return *this;
  }
  RationalNumber &operator*=(const RationalNumber &x){
    a *= x.a, b *= x.b;
    reduction();
    return *this;
  }
  RationalNumber &operator/=(const RationalNumber &x){
    a *= x.b, b *= x.a;
    reduction();
    return *this;
  }
  RationalNumber operator+(const RationalNumber &x)const{
    return RationalNumber(*this) += x;
  }
  RationalNumber operator-(const RationalNumber &x)const{
    return RationalNumber(*this) -= x;
  }
  RationalNumber operator*(const RationalNumber &x)const{
    return RationalNumber(*this) *= x;
  }
  RationalNumber operator/(const RationalNumber &x)const{
    return RationalNumber(*this) /= x;
  }
  RationalNumber operator-()const{
    return RationalNumber(-a, b);
  }
  bool operator==(const RationalNumber &x)const{
    return a * x.b == b * x.a;
  };
  bool operator!=(const RationalNumber &x)const{
    return !(*this == x);
  };
  bool operator<(const RationalNumber &x)const{
    return a * x.b < b * x.a;
  }
  bool operator>(const RationalNumber &x)const{
    return a * x.b > b * x.a;
  }
  bool operator<=(const RationalNumber &x)const{
    return *this < x || *this == x;
  }
  bool operator>=(const RationalNumber &x)const{
    return *this > x || *this == x;
  }
  friend ostream &operator<<(ostream &os, RationalNumber x){
    os << x.a << "/" << x.b;
  }
};
using rat = RationalNumber;
int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  ll n,t;cin>>n>>t;
  vector<ll>a(n),b(n);
  rep(i,0,n)cin>>a[i]>>b[i];
  vector<pair<rat,ll>>p;
  vector<ll>q;
  rep(i,0,n){
    if(a[i]!=0)p.EB(rat(b[i]+1,a[i]),i);
    else q.PB(b[i]+1);
  }
  sort(ALL(p));
  sort(ALL(q));
  ll sz1=p.size(),sz2=q.size();
  rep(i,0,sz2-1)q[i+1]+=q[i];
  //debug(q,sz2);
  ll lim=40;
  auto dp=vec(sz1+1,lim,t+1);
  dp[0][0]=0;
  rep(i,0,sz1){
    //cout<<p[i].fi spa p[i].se<<endl;
    rep(j,0,lim){
      if(j+1<lim)chmin(dp[i+1][j+1],dp[i][j]+a[p[i].se]*(dp[i][j]+1)+b[p[i].se]+1);
      chmin(dp[i+1][j],dp[i][j]);
    }
  }
  //debug(dp,sz1+1,10);
  rep(i,0,lim){
    if(dp[sz1][i]==t+1)continue;
    chmax(res,i+(lower_bound(ALL(q),t+1-dp[sz1][i])-q.begin()));
    //cout<<i spa dp[sz1][i] spa lower_bound(ALL(q),t+1-dp[sz1][i])-q.begin()<<endl;
  }
  cout<<res<<endl;
  return 0;
}

Measured memory_bytes: 79468