#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
void *wmem;
char memarr[96000000];
template<class T> inline void walloc1d(T **arr, int x, void **mem = &wmem){
  static int skip[16] = {0, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1};
  (*mem) = (void*)( ((char*)(*mem)) + skip[((unsigned long long)(*mem)) & 15] );
  (*arr)=(T*)(*mem);
  (*mem)=((*arr)+x);
}
template<class T1> void sortA_L(int N, T1 a[], void *mem = wmem){
  sort(a, a+N);
}
inline int my_getchar_unlocked(){
  static char buf[1048576];
  static int s = 1048576;
  static int e = 1048576;
  if(s == e && e == 1048576){
    e = fread_unlocked(buf, 1, 1048576, stdin);
    s = 0;
  }
  if(s == e){
    return EOF;
  }
  return buf[s++];
}
inline void rd(int &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = my_getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = my_getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
inline void rd(long long &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = my_getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = my_getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
struct MY_WRITER{
  char buf[1048576];
  int s;
  int e;
  MY_WRITER(){
    s = 0;
    e = 1048576;
  }
  ~MY_WRITER(){
    if(s){
      fwrite_unlocked(buf, 1, s, stdout);
    }
  }
}
;
MY_WRITER MY_WRITER_VAR;
void my_putchar_unlocked(int a){
  if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){
    fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout);
    MY_WRITER_VAR.s = 0;
  }
  MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a;
}
inline void wt_L(char a){
  my_putchar_unlocked(a);
}
inline void wt_L(int x){
  int s=0;
  int m=0;
  char f[10];
  if(x<0){
    m=1;
    x=-x;
  }
  while(x){
    f[s++]=x%10;
    x/=10;
  }
  if(!s){
    f[s++]=0;
  }
  if(m){
    my_putchar_unlocked('-');
  }
  while(s--){
    my_putchar_unlocked(f[s]+'0');
  }
}
template<class S> inline void arrInsert(const int k, int &sz, S a[], const S aval){
  int i;
  sz++;
  for(i=sz-1;i>k;i--){
    a[i] = a[i-1];
  }
  a[k] = aval;
}
template<class S, class T> inline void arrInsert(const int k, int &sz, S a[], const S aval, T b[], const T bval){
  int i;
  sz++;
  for(i=sz-1;i>k;i--){
    a[i] = a[i-1];
  }
  for(i=sz-1;i>k;i--){
    b[i] = b[i-1];
  }
  a[k] = aval;
  b[k] = bval;
}
template<class S, class T, class U> inline void arrInsert(const int k, int &sz, S a[], const S aval, T b[], const T bval, U c[], const U cval){
  int i;
  sz++;
  for(i=sz-1;i>k;i--){
    a[i] = a[i-1];
  }
  for(i=sz-1;i>k;i--){
    b[i] = b[i-1];
  }
  for(i=sz-1;i>k;i--){
    c[i] = c[i-1];
  }
  a[k] = aval;
  b[k] = bval;
  c[k] = cval;
}
template<class S, class T, class U, class V> inline void arrInsert(const int k, int &sz, S a[], const S aval, T b[], const T bval, U c[], const U cval, V d[], const V dval){
  int i;
  sz++;
  for(i=sz-1;i>k;i--){
    a[i] = a[i-1];
  }
  for(i=sz-1;i>k;i--){
    b[i] = b[i-1];
  }
  for(i=sz-1;i>k;i--){
    c[i] = c[i-1];
  }
  for(i=sz-1;i>k;i--){
    d[i] = d[i-1];
  }
  a[k] = aval;
  b[k] = bval;
  c[k] = cval;
  d[k] = dval;
}
template<class S, class T> inline S chmin(S &a, T b){
  if(a>b){
    a=b;
  }
  return a;
}
template<class S, class T> inline S chmax(S &a, T b){
  if(a<b){
    a=b;
  }
  return a;
}
int N;
long long A[200000];
long long B[200000];
long long T;
pair<long long,long long> v[200000];
long long dp[100];
long long nx[100];
int mx;
int sz;
long long con[200000];
int main(){
  wmem = memarr;
  int i;
  int j;
  int k;
  int res = 0;
  int tmp;
  long long t;
  rd(N);
  rd(T);
  {
    int Lj4PdHRW;
    for(Lj4PdHRW=(0);Lj4PdHRW<(N);Lj4PdHRW++){
      rd(A[Lj4PdHRW]);
      rd(B[Lj4PdHRW]);
    }
  }
  k = 0;
  for(i=(0);i<(N);i++){
    if(A[i]==0){
      con[sz++] = B[i] + 1;
      continue;
    }
    arrInsert(k,k,A,A[i],B,B[i]);
  }
  N = k;
  sortA_L(sz, con);
  for(i=(0);i<(N);i++){
    v[i] = make_pair(A[i],B[i]);
  }
  sort(
    v, v+N,
    [](pair<long long,long long> const &x, pair<long long,long long> const &y){
      return
      (1 + (x.first + x.second) + 1 + (x.first + x.second + 2) * y.first + y.second) <
      (1 + (y.first + y.second) + 1 + (y.first + y.second + 2) * x.first + x.second);
    }
  );
  for(i=(0);i<(N);i++){
    {
      auto t_ynMSdg = (v[i].first);
      auto KrdatlYV = ( v[i].second);
      A[i] = t_ynMSdg;
      B[i] = KrdatlYV;
    }
  }
  for(i=(0);i<(N);i++){
    for(j=(mx+2)-1;j>=(1);j--){
      t = dp[j-1] + 1 + (dp[j-1] + 1) * A[i] + B[i];
      if(t > T){
        continue;
      }
      if(j == mx + 1){
        mx = j;
        dp[j] = t;
        continue;
      }
      chmin(dp[j], t);
    }
  }
  for(i=(0);i<(mx+1);i++){
    t = dp[i];
    tmp = i;
    for(j=(0);j<(sz);j++){
      if(t + con[j] <= T){
        t += con[j];
        tmp++;
      }
    }
    chmax(res, tmp);
  }
  wt_L(res);
  wt_L('\n');
  return 0;
}
// cLay varsion 20200308-1

// --- original code ---
// int N; ll A[2d5], B[2d5], T;
// pair<ll,ll> v[2d5];
// 
// ll dp[100], nx[100]; int mx;
// int sz; ll con[2d5];
// 
// {
//   int i, j, k, res = 0, tmp;
//   ll t;
// 
//   rd(N,T,(A,B)(N));
//   k = 0;
//   rep(i,N){
//     if(A[i]==0) con[sz++] = B[i] + 1, continue;
//     arrInsert(k,k,A,A[i],B,B[i]);
//   }
//   N = k;
//   sortA(sz, con);
// 
//   rep(i,N) v[i] = make_pair(A[i],B[i]);
//   sort(
//     v, v+N,
//     [](pair<ll,ll> const &x, pair<ll,ll> const &y){
//       return
//       (1 + (x.first + x.second) + 1 + (x.first + x.second + 2) * y.first + y.second) <
//       (1 + (y.first + y.second) + 1 + (y.first + y.second + 2) * x.first + x.second);
//     }
//   );
//   rep(i,N) (A[i], B[i]) = (v[i].first, v[i].second);
// 
//   rep(i,N){
//     rrep(j,1,mx+2){
//       t = dp[j-1] + 1 + (dp[j-1] + 1) * A[i] + B[i];
//       if(t > T) continue;
//       if(j == mx + 1){
//         mx = j;
//         dp[j] = t;
//         continue;
//       }
//       dp[j] <?= t;
//     }
//   }
// 
//   rep(i,mx+1){
//     t = dp[i];
//     tmp = i;
//     rep(j,sz) if(t + con[j] <= T) t += con[j], tmp++;
//     res >?= tmp;
//   }
//   wt(res);
// }


Measured memory_bytes: 10624