#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef gp_hash_table<int, null_type,hash<int>, equal_to<int>, direct_mask_range_hashing<int>, linear_probe_fn<>,
    hash_standard_resize_policy<hash_exponential_size_policy<>, hash_load_check_resize_trigger<true>,true>> hash_set;

#define scan(x) do{while((x=getchar())<'0'); for(x-='0'; '0'<=(_=getchar()); x=(x<<3)+(x<<1)+_-'0');}while(0)
char _;
#define complete_unique(a) a.erase(unique(a.begin(),a.end()),a.end())
#define all(a) a.begin(),a.end()
#define println printf("\n");
#define readln(x) getline(cin,x);
#define pb push_back
#define endl "\n"
#define INT_INF 0x3f3f3f3f
#define LL_INF 0x3f3f3f3f3f3f3f3f
#define EPS 1e-9
#define MOD 1000000007
#define MOD2 1494318097
#define SEED 131
#define mp make_pair
#define fastio cin.tie(0); cin.sync_with_stdio(0);

#define MAXN 200005
#define LOGN 31

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef pair<int,pii> triple;
typedef int8_t byte;

const ld PI = (ld)4*atanl(1);

mt19937 g1(chrono::steady_clock::now().time_since_epoch().count());

int randint(int a, int b){return uniform_int_distribution<int>(a, b)(g1);}
ll randlong(ll a,ll b){return uniform_int_distribution<long long>(a, b)(g1);}

ll gcd(ll a, ll b){return b == 0 ? a : gcd(b, a % b);}
ll lcm(ll a, ll b){return a*b/gcd(a,b);}
ll fpow(ll  b, ll exp, ll mod){if(exp == 0) return 1;ll t = fpow(b,exp/2,mod);if(exp&1) return t*t%mod*b%mod;return t*t%mod;}
ll divmod(ll i, ll j, ll mod){i%=mod,j%=mod;return i*fpow(j,mod-2,mod)%mod;}

int len,T,res;
pii arr[MAXN];
bool poss[MAXN][LOGN];
ll dp[MAXN][LOGN];

int main(){
    scanf(" %d %d",&len,&T);
    for(int i=1; i<=len; i++)
        scanf(" %d %d",&arr[i].first,&arr[i].second);
    sort(arr+1,arr+len+1,[](pii a, pii b){
        return (ld)a.first/(a.second+1)>(ld)b.first/(b.second+1);
    });
    int pt = len+1;
    for(int i=1; i<=len; i++){
        if(arr[i].first == 0){
            pt = i;
            break;
        }
    }
    for(int i=0; i<MAXN; i++) poss[i][0] = true;
    for(int i=1; i<pt; i++){
        for(int k=1; k<LOGN; k++){
            if(poss[i-1][k]) dp[i][k] = dp[i-1][k], poss[i][k] = true;
            if(poss[i-1][k-1] && dp[i-1][k-1] <= T){
                ll t = dp[i-1][k-1]+1+(dp[i-1][k-1]+1)*arr[i].first+arr[i].second;
                if(poss[i-1][k]) dp[i][k] = min(dp[i][k],t);
                else dp[i][k] = t;
                poss[i][k] = true;
            }
        }
    }
    vector<int> v;
    for(int i=pt; i<=len; i++)
        v.pb(arr[i].second);
    sort(all(v));
    for(int k=0; k<LOGN; k++){
        if(!poss[pt-1][k]) continue;
        ll sum = dp[pt-1][k];
        if(sum <= T) res = max(res,k);
        for(int i=0; i<v.size(); i++){
            sum = sum+1+v[i];
            if(sum <= T) res = max(res,k+i+1);
            else break;
        }
    }
    printf("%d\n",res);
}

Measured memory_bytes: 56320