#ifndef DEBUG
#  define NDEBUG
#endif
#include <iostream>
#include <string>
#include <iterator>
#include <utility>
#include <type_traits>
#include <limits>
#include <cassert>
#include <vector>
#include <algorithm>
#include <numeric>

using namespace std;

// template {{{
// misc {{{
using Z = long long;
[[maybe_unused]]
constexpr Z INF = numeric_limits<Z>::max() / 3;
// }}}

// debug {{{
template <class T>
using enable_if_sequence_t = enable_if_t<
  is_same<
    typename iterator_traits<
      typename remove_cv_t<remove_reference_t<T>>::iterator
    >::iterator_category,
    random_access_iterator_tag>{}>;
#ifdef NDEBUG
# define dump(x)
# define debug if (0)
template <class T>
inline T&& ix(T&& value) { return value; }
template <class T, class Index, class... Indices, class = enable_if_sequence_t<T>>
inline auto&& ix(T&& container, Index index, Indices... indices) {
  return ix(container[index], indices...);
}
#else
# define dump(x) do { \
    cerr << "\e[33m[dump: " << __LINE__ << "] " << (#x) << " = " << x << "\e[0m" << endl; \
  } while (0);
# define debug
template <class T>
inline auto&& ix_impl([[maybe_unused]] int line, [[maybe_unused]] const char* code, T&& value) {
  return value;
}
template <class T, class Index, class... Indices, class = enable_if_sequence_t<T>>
inline auto&& ix_impl(int line, const char* code, T&& container, Index index, Indices... indices) {
  if (index < 0) {
    cerr << "\e[31mix: negative index at line " << line << ", ix(" << code << ")\e[0m" << endl;
    exit(1);
  }
  int size = container.size();
  if (index >= size) {
    cerr << "\e[31mix: index out of range at line " << line << ", ix(" << code << ")\n"
      << "index = " << index << " whereas size = " << size << "\e[0m" << endl;
    exit(1);
  }
  return ix_impl(line, code, container[index], indices...);
}
#define ix(...) ix_impl(__LINE__, #__VA_ARGS__, __VA_ARGS__)
#endif
// }}}

// IO {{{
template <class T, class U>
ostream& operator<< (ostream& os, pair<T, U> p) {
  os << '(' << p.first << ", " << p.second << ')';
  return os;
}
template <class T>
false_type is_container_impl(...);
template <class T, class = typename T::iterator>
true_type is_container_impl(T);
template <class T>
struct is_container : decltype(is_container_impl<T>(declval<T>())) {};
template <>
struct is_container <string> : std::false_type {};
template <class Container, class = enable_if_t<is_container<Container>{}>>
istream& operator>> (istream& is, Container& cont) {
  for (auto& v : cont) is >> v;
  return is;
}
template <class Container, class = enable_if_t<is_container<Container>{}>>
ostream& operator<< (ostream& os, Container const& cont) {
  bool first = true;
  constexpr char sep =
    is_container<typename Container::value_type>{} ? '\n' : ' ';
  for (auto const& v : cont) {
    if (!first) {
      os << sep;
    }
    first = false;
    os << v;
  }
  return os;
}
// }}}
// }}}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  Z N, T;
  cin >> N >> T;
  vector<pair<Z, Z>> ab(N);
  for (auto i = 0; i < N; i++) {
    cin >> ix(ab, i).first >> ix(ab, i).second;
    ix(ab, i).second += ix(ab, i).first + 1;
  }
  sort(begin(ab), end(ab),
      [] (auto p, auto q) {
        if (p.first == q.first) return p.second < q.second;
        return p.first * q.second > q.first * p.second;
      });
  dump(ab);
  Z logT = 0;
  while ((1 << logT) < T) logT++;
  Z finiteA = 0;
  for (finiteA = 0; finiteA < N; finiteA++)
    if (ix(ab, finiteA).first == 0) break;
  dump(finiteA);
  vector<vector<Z>> dp(finiteA + 1, vector<Z>(logT + 1, T + 1));
  ix(dp, 0, 0) = 0;
  for (auto i = 0; i < finiteA; i++) {
    for (auto j = 0; j < logT; j++) {
      ix(dp, i + 1, j) = min(ix(dp, i + 1, j), ix(dp, i, j));
      ix(dp, i + 1, j + 1) = min(ix(dp, i + 1, j + 1), (ix(ab, i).first + 1) * ix(dp, i, j) + ix(ab, i).second);
    }
  }
  dump(dp);
  Z ans = 0;
  vector<Z> zeros_sum(N - finiteA + 1);
  for (auto i = finiteA; i < N; i++)
    ix(zeros_sum, i + 1 - finiteA) += ix(zeros_sum, i - finiteA) + ix(ab, i).second;
  for (auto i = 0; i <= logT; i++) {
    if (ix(dp, finiteA, i) > T) continue;
    auto ok = upper_bound(begin(zeros_sum), end(zeros_sum), T - ix(dp, finiteA, i));
    Z rest = distance(begin(zeros_sum) + 1, ok);
    dump(rest);
    ans = max(ans, i + rest);
  }
  cout << ans << endl;
}



Measured memory_bytes: 58112