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

#define int long long
#define rep(i, n) for (int i = 0; i < (int) (n); i++)
#define reps(i, n) for (int i = 1; i <= (int) (n); i++)
#define all(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(all(x)), (x).end())
#define bit(n) (1LL << (n))
#define cdiv(a, b) (((a) - 1) / (b) + 1)
#define dump(x) cerr << #x " = " << (x) << endl
using vint = vector<int>;
using vvint = vector<vint>;
using pint = pair<int, int>;
using vpint = vector<pint>;
template<typename T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
constexpr double PI = 3.1415926535897932384626433832795028;
constexpr int DY[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
constexpr int DX[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
int gcd(int a, int b) {
    while (b) { swap(a %= b, b); }
    return a;
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int sgn(int x) { return (x > 0) - (x < 0); }
template<typename T> void fin(T mes) {
    cout << mes << endl;
    exit(0);
}
template<typename T, typename U> bool chmax(T &a, const U &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template<typename T, typename U> bool chmin(T &a, const U &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
template<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &rhs) {
    os << "(" << rhs.first << ", " << rhs.second << ")";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const vector<T> &rhs) {
    os << "{";
    for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
        os << *itr << (next(itr) != rhs.end() ? ", " : "");
    }
    os << "}";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const deque<T> &rhs) {
    os << "{";
    for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
        os << *itr << (next(itr) != rhs.end() ? ", " : "");
    }
    os << "}";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const set<T> &rhs) {
    os << "{";
    for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
        os << *itr << (next(itr) != rhs.end() ? ", " : "");
    }
    os << "}";
    return os;
}
template<typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &rhs) {
    os << "{";
    for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
        os << *itr << (next(itr) != rhs.end() ? ", " : "");
    }
    os << "}";
    return os;
}
struct setup {
    static constexpr int PREC = 20;
    setup() {
        cout << fixed << setprecision(PREC);
        cerr << fixed << setprecision(PREC);
    };
} setup;

int N, T;
int a[220000], b[220000];
pint ab[220000];
constexpr int B = 44;
int dp[220000][B];
signed main() {
    cin >> N >> T;
    rep(i, N) { cin >> a[i] >> b[i], ab[i] = {a[i] + 1, a[i] + b[i] + 1}; }
    sort(ab, ab + N, [](pint l, pint r) { return l.second < r.second; });
    stable_sort(ab, ab + N, [](pint l, pint r) { return (l.first - 1) * r.second > (r.first - 1) * l.second; });
    vint last{0};
    rep(i, N + 1) { fill(dp[i], dp[i] + B, T + 1); }
    dp[0][0] = 0;
    rep(i, N) {
        a[i] = ab[i].first, b[i] = ab[i].second;
        if (a[i] == 1) {
            last.emplace_back(last.back() + b[i]);
            continue;
        }
        rep(j, B) {
            chmin(dp[i + 1][j], dp[i][j]);
            if (a[i] * dp[i][j] + b[i] <= T && j != B - 1) { chmin(dp[i + 1][j + 1], a[i] * dp[i][j] + b[i]); }
        }
    }
    N -= last.size() - 1;
    int ans = 0;
    rep(i, B) { if (dp[N][i] <= T) { chmax(ans, upper_bound(all(last), T - dp[N][i]) - last.begin() - 1 + i); }}
    cout << ans << endl;
}

Measured memory_bytes: 82164