#define CPP17
#include <limits>
#include <initializer_list>
#include <utility>
#include <bitset>
#include <tuple>
#include <type_traits>
#include <functional>
#include <string>
#include <array>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <iterator>
#include <algorithm>
#include <complex>
#include <random>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <regex>
#include <cassert>
#include <cstddef>
#ifdef CPP17
#include <variant>
#endif

#define endl codeforces

#define ALL(v) std::begin(v), std::end(v)
#define ALLR(v) std::rbegin(v), std::rend(v)

using ll = std::int64_t;
using ull = std::uint64_t;
using pii = std::pair<int, int>;
using tii = std::tuple<int, int, int>;
using pll = std::pair<ll, ll>;
using tll = std::tuple<ll, ll, ll>;
using size_type = ssize_t;
template <typename T> using vec = std::vector<T>;
template <typename T> using vvec = vec<vec<T>>;

template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }

template <typename T, std::size_t Head, std::size_t... Tail> 
struct multi_dim_array { using type = std::array<typename multi_dim_array<T, Tail...>::type, Head>; };

template <typename T, std::size_t Head> 
struct multi_dim_array<T, Head> { using type = std::array<T, Head>; };

template <typename T, std::size_t... Args> using mdarray = typename multi_dim_array<T, Args...>::type;

#ifdef CPP17
template <typename T, typename F, typename... Args> 
void fill_seq(T &t, F f, Args... args) { 
    if constexpr (std::is_invocable<F, Args...>::value) { 
        t = f(args...); 
    } else { 
        for (size_type i = 0; i < t.size(); i++) fill_seq(t[i], f, args..., i); 
    } 
}
#endif

template <typename T> vec<T> make_v(size_type sz) { return vec<T>(sz); }

template <typename T, typename... Tail> 
auto make_v(size_type hs, Tail&&... ts) { 
    auto v = std::move(make_v<T>(std::forward<Tail>(ts)...)); 
    return vec<decltype(v)>(hs, v); 
}

namespace init__ { 
struct InitIO { 
    InitIO() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(30); } 
} init_io; 
}
#define CPP17


const size_type SIZE = 64;
mdarray<ll, SIZE> dp;
const ll inf = 1e9 + 10;

int main() {
    ll n, t;
    std::cin >> n >> t;
    vec<pll> ab(n);
    for (auto& [ a, b ] : ab) std::cin >> a >> b;
    std::fill(ALL(dp), inf);
    dp[0] = 0;

    vec<pll> ab0, ab1;
    for (auto [ a, b ] : ab) {
        auto &v = (a == 0 ? ab0 : ab1);
        v.emplace_back(a, b);
    }

    std::sort(ALL(ab0));
    std::sort(ALL(ab1), [](pll p, pll q) {
        auto [ ai, bi ] = p;
        auto [ aj, bj ] = q;
        return aj * (bi + 1) < ai * (bj + 1);
    });

    vec<ll> sumv(ab0.size() + 1);
    for (ll i = 0; i < ab0.size(); i++) sumv[i + 1] = sumv[i] + ab0[i].second + 1;
    if (sumv.back() < inf) sumv.push_back(inf);

    for (auto [ a, b ] : ab1) {
        for (ll i = SIZE - 2; 0 <= i; i--) {
            ll cur = dp[i];
            ll wait = a * (cur + 1) + b;
            chmin(dp[i + 1], cur + 1 + wait);
        }
    }

    ll ans = 0;
    for (ll i = 0; i < SIZE; i++) {
        if (t < dp[i]) continue;
        ll rest = t - dp[i];
        auto ite = std::upper_bound(ALL(sumv), rest) - 1;
        ll add = std::distance(sumv.begin(), ite);
        chmax(ans, i + add);
    }

    std::cout << ans << "\n";
    return 0;
}


Measured memory_bytes: 12640