#include <bits/stdc++.h>
 
//#include <unistd.h>
//#include <iostream>
 
using namespace std;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
typedef long long ll;
#define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;
//int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
//int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
const ll MOD = 1000000007;
//const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'

bool cmp(pll a, pll b) {
    if (a.first == 0 and b.first == 0) {
        return a.second > b.second;
    }
    else if (a.first == 0) return false;
    else if (b.first == 0) return true;
    else {
        return (long double)(a.second + 1) / a.first < (long double)(b.second + 1) / b.first;
    }
}

signed main() {
    fio();
    ll n, t;
    cin >> n >> t;
    vl a(n), b(n);
    vector<pll> ab(n);
    rep (i, n) {
        cin >> a[i] >> b[i];
        ab[i] = pll(a[i], b[i]);
    }
    sort(all(ab), cmp);
    //DEBUG_VEC(ab);

    vector<pll> ze;
    rrep (i, n) {
        if (ab[i].first == 0) {
            ze.push_back(ab[i]);
            ab.pop_back();
        }
        else break;
    }
    sort(all(ze));

    int m = 35;
    vll dp(ab.size() + 1, vl(m, INF));
    dp[0][0] = 0;
    rep (i, ab.size()) {
        rep (j, m) {
            if (dp[i][j] == INF) continue;
            chmin(dp[i + 1][j], dp[i][j]);
            if (j < m) {
                ll now = dp[i][j];
                ll nex = (1 + now) + ab[i].first * (1 + now) + ab[i].second;
                if (nex <= t) {
                    chmin(dp[i + 1][j + 1], nex);
                }
            }
        }
    }

    ll ans = 0;
    rep (j, m) {
        ll time = dp[ab.size()][j];
        if (time > t) continue;
        ll x = j;
        rep (i, ze.size()) {
            if (time + 1 + ze[i].second <= t) {
                time += 1 + ze[i].second;
                x++;
            }
        }
        chmax(ans, x);
    }
    cout << ans << endl;
}

Measured memory_bytes: 67456