/*
 /+==================================================+\
//+--------------------------------------------------+\\
|.|\\...>>>>>>> Hollwo_Pelw(ass) 's code <<<<<<<...//|.|
\\+--------------------------------------------------+//
 \+==================================================+/
*/
#include <bits/stdc++.h>
using namespace std;
// type
typedef long long ll;
typedef long double ld;
// pair
#define F                   first
#define S                   second
#define pii                 pair<int, int>
#define pll                 pair<ll, ll>
#define pdd                 pair<ld, ld>
// vector & !!?(string)
#define eb                  emplace_back
#define pb                  push_back
#define all(a)              a.begin(), a.end()
#define rall(a)             a.rbegin(), a.rend()
#define sz(a)               a.size()
#define len(a)              a.length()
// I/O
#define open(file, in, out) if (fopen(file in, "r")) {        \
                                freopen(file in, "r", stdin);  \
                                freopen(file out, "w", stdout); \
                            }
#define FAST_IO             std::ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define setpre(n)           fixed << setprecision(n)
bool endline = false;
template<class T>
istream& operator >> (istream& inp, vector<T>& v){
    for (auto& it : v) inp >> it;
    return inp;
}
template<class T>
ostream& operator << (ostream& out, vector<T>& v){
    for (auto& it : v) out << it << (endline ? "\n" : " ");
    return out;
}
template<class T, class U>
istream& operator >> (istream& inp, pair<T, U>& v){
    inp >> v.F >> v.S;
    return inp;
}
template<class T, class U>
ostream& operator << (ostream& out, pair<T, U>& v){
    out << v.F << ' ' << v.S;
    return out;
}

// geometry calculate
#define pi                  acos(-1.0)
#define g_sin(a)            sin(a*pi/180)
#define g_cos(a)            cos(a*pi/180)
#define g_tan(a)            tan(a*pi/180)
// set val
#define ms0(a)              memset(a,        0, sizeof(a));
#define ms1(a)              memset(a,        1, sizeof(a));
#define msn1(a)             memset(a,       -1, sizeof(a));
#define msinf(a)            memset(a, 0x3f3f3f, sizeof(a));
// constant
const int mod1 = 998244353, mod = 1e9 + 7;
const int MAXN = 2e5 + 6 , MAXM = 5e5 + 5;
const int inf = 2e9; const ll linf = 1e18;
// code
#define int long long

int n, T, dp[32];

void Solve() {
    cin >> n >> T; T++;
    vector<pii> a;
    vector<int> v;
    for (int i = 0, x, y; i < n; i++){
        cin >> x >> y;
        if (!x) v.eb(y + 1);
        else a.eb(x + 1, x + y + 1);
    }
    sort(all(a), [] (const pii& x, const pii& y){
        return (x.F - 1) * y.S > (y.F - 1) * x.S;
    });
    sort(all(v));
    // if ai > 0 then you can't visit more than log2(T)
    for (int i = 1; i <= 30; i++){
        dp[i] = inf;
    }
    for (auto p : a){
        for (int j = 30; j > 0; j--){
            dp[j] = min(dp[j], dp[j-1] * p.F + p.S);
        }
    }
    vector<int> pf(v.size() + 1, 0);
    for (int i = 0; i < v.size(); i++){
        pf[i + 1] = pf[i] + v[i];
    }
    int res = 0;
    for (int i = 0; i <= 30; i++){
        if (dp[i] > T) continue;
//        cerr << dp[i] << ' ' << (upper_bound(all(pf), T - dp[i]) - pf.begin()) << endl;
        res = max(res, i - 1 + (lower_bound(all(pf), T - dp[i]) - pf.begin()));
    }
    cout << res;
}

signed main(){
    open("", ".inp", ".out");
    FAST_IO; int TC = 1;
//    cin >> TC;
    while(TC--) Solve();
    return 0;
}
/*

\/-=====>>><<<-------- DEBUG -------->>><<<=====-\/
/\.............................................../\
+====================== INP ======================+


+====================== OUT ======================+


+======================*****======================+
\/...............................................\/
/\-=====>>><<<--------= END =-------->>><<<=====-/\

*/


Measured memory_bytes: 7436