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

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define whole(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define bit(n) (1LL<<(n))
// functions
template <typename T> void unique(T& c){c.erase(std::unique(c.begin(), c.end()), c.end());}
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << "(" << p.first << ", " << p.second << ")"; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(20);}
} fast_io_;

ll dp[200010];

int main(int argc, char const* argv[])
{
  int n; cin >> n;
  ll T; cin >> T;
  vector<ll> a(n), b(n); rep(i, n)cin >> a[i] >> b[i];
  int k = 0;
  vector<int> zidx;
  rep(i, n){
    if(a[i] == 0){
      k++;
      zidx.pb(i);
    }
  }
  rep(i, n + 1)dp[i] = linf;
  dp[0] = 0;
  vector<int> e;
  rep(i, n){
    if(a[i] != 0)e.pb(i);
  }
  sort(whole(e), [&](int i, int j){
    ll x1 = a[j] * b[i] + a[j];
    ll x2 = a[i] * b[j] + a[i];
    if(x1 != x2)return x1 < x2;
    if(a[i] != a[j])return a[i] < a[j];
    if(b[i] != b[j])return b[i] < b[j];
    return i < j;
  });
  int r = n - k;
  rep(i, n - k){
    int rt = r;
    while(r <= n){
      ll tmp = dp[r-1] + 1 + a[e[i]] * (dp[r-1] + 1) + b[e[i]];
      if(tmp <= T)r++;
      else break;
    }
    if(r == n + 1)r = n;
    for(int j = r; j > 0; j--){
      ll tmp = dp[j-1] + 1 + a[e[i]] * (dp[j-1] + 1) + b[e[i]];
      if(tmp <= T)chmin(dp[j], tmp);
      else{
        rt = j;
      }
    }
    r = rt;
  }
  vector<ll> zb(k); rep(i, k)zb[i] = b[zidx[i]];
  sort(whole(zb));
  rep(i, k)zb[i]++;
  FOR(i, 1, k)zb[i] += zb[i-1];

  int res = 0;
  rep(i, n + 1){
    if(dp[i] > T)continue;
    int idx = upper_bound(whole(zb), T - dp[i]) - zb.begin();
    idx--;
    chmax(res, i + idx + 1);
  }
  cout << res << endl;
  return 0;
}


Measured memory_bytes: 7412