#include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint mod = 998244353;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl((lint)(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T = string, class U = char>int character_count(T text, U character){ int ans = 0; for(U i: text){ ans += (i == character); } return ans; }
lint power(lint base, lint exponent, lint module){ if(exponent % 2){ return power(base, exponent - 1, module) * base % module; }else if(exponent){ lint root_ans = power(base, exponent / 2, module); return root_ans * root_ans % module; }else{ return 1; }}
struct position{ int y, x; }; position mv[4] = {{0, -1}, {1, 0}, {0, 1}, {-1, 0}}; // double euclidean(position first, position second){ return sqrt((second.x - first.x) * (second.x - first.x) + (second.y - first.y) * (second.y - first.y)); }
template<class T, class U> string to_string(pair<T, U> x){ return to_string(x.first) + "," + to_string(x.second); } string to_string(string x){ return x; }
template<class itr> void array_output(itr start, itr goal){ string ans; for(auto i = start; i != goal; i++) ans += to_string(*i) + " "; if(!ans.empty()) ans.pop_back(); cout << ans << endl; }
template<class itr> void cins(itr first, itr last){ for(auto i = first; i != last; i++){ cin >> (*i); } }
template<class T> T gcd_calc(T a, T b){ if(b){ return gcd_calc(b, a % b); }else{ return a; }}
template<class T> T gcd(T a, T b){ if(a < b) swap(a, b); return gcd_calc(a, b); }
template<class T> T lcm(T a, T b){ return a / gcd(a, b) * b; }
struct combination{ vector<lint> fact, inv; combination(int sz) : fact(sz + 1), inv(sz + 1){ fact[0] = 1; for(int i = 1; i <= sz; i++){ fact[i] = fact[i - 1] * i % mod; } inv[sz] = power(fact[sz], mod - 2, mod); for(int i = sz - 1; i >= 0; i--){ inv[i] = inv[i + 1] * (i + 1) % mod; } } lint C(int p, int q) const{ if(q < 0 || p < q) return 0; return (fact[p] * inv[q] % mod * inv[p - q] % mod); } };
template<class itr> bool next_sequence(itr first, itr last, int max_bound){ itr now = last; while(now != first){ now--; (*now)++; if((*now) == max_bound){ (*now) = 0; }else{ return true; } } return false; }
inline int at(int x, int k){ return (x >> k) & 1; }

using ld = long double;

int M;
lint T;

lint dp[202020][32];

vector<lint> a, b;

lint buy(int now, int need){
    if(need == 0){
        return 0;
    }
    if(now == -1){
        return T + 1;
    }
    if(dp[now][need] != -1){
        return dp[now][need];
    }
    lint ans = buy(now - 1, need);
    lint buy_time = buy(now - 1, need - 1) + 1;
    ans = min(ans, buy_time + a[now] * buy_time + b[now]);
    return dp[now][need] = ans;
}


int main(){
    int N;
    cin >> N >> T;
    M = 0;
    vector<lint> constant;
    vector<pair<ld, pair<lint, lint>>> shops;
    for(int i = 0; i < N; i++){
        lint a, b;
        cin >> a >> b;
        if(a == 0){
            constant.push_back(b);
        }else{
            M++;
            pair<ld, pair<lint, lint>> item;
            item.second.first = a;
            item.second.second = b;
            item.first = ld(a) / ld(b + 1);
            shops.push_back(item);
        }
    }
    sort(all(shops), greater<>());
    for(auto i: shops){
        a.push_back(i.second.first);
        b.push_back(i.second.second);
    }
    sort(all(constant));
    vector<lint> constant_sum{0};
    for(lint i: constant){
        lint item = constant_sum.back() + i + 1;
        constant_sum.push_back(item);
    }
    memset(dp, -1, sizeof(dp));
    int ans = 0;
    for(int i = 0; i <= 30; i++){
        lint this_time = buy(M - 1, i);
        //cout << this_time << endl;
        if(this_time > T){
            continue;
        }
        int constant_buy = int(upper_bound(all(constant_sum), T - this_time) - constant_sum.begin() - 1);
        ans = max(ans, i + constant_buy);
    }
    cout << ans << endl;
}



Measured memory_bytes: 73448