/*{{{*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<bitset>
#include<vector>
#include<limits.h>
#include<assert.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define FOR(I, A, B) for (int I = (A); I <= (B); ++I)
#define FORS(I, S) for (int I = 0; S[I]; ++I)
#define RS(X) scanf("%s", (X))
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
#define CASET int ___T; scanf("%d", &___T); for(int cs=1;cs<=___T;cs++)
#define MP make_pair
#define PB push_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PII> VPII;
typedef pair<LL,LL> PLL;
typedef vector<PLL> VPLL;
template<class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(LL &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template<class T, class... U> void R(T &head, U &... tail) { _R(head); R(tail...); }
template<class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const LL &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template<class T,class U> void _W(const pair<T,U> &x) {_W(x.F); putchar(' '); _W(x.S);}
template<class T> void _W(const vector<T> &x) { for (auto i = x.begin(); i != x.end(); _W(*i++)) if (i != x.cbegin()) putchar(' '); }
void W() {}
template<class T, class... U> void W(const T &head, const U &... tail) { _W(head); putchar(sizeof...(tail) ? ' ' : '\n'); W(tail...); }
#ifdef HOME
 #define DEBUG(...) {printf("# ");printf(__VA_ARGS__);puts("");}
#else
 #define DEBUG(...)
#endif
int MOD = 1e9+7;
void ADD(LL& x,LL v){x=(x+v)%MOD;if(x<0)x+=MOD;}
/*}}}*/
const int SIZE = 1e6+10;
int N,T;
int a[SIZE],b[SIZE],d[SIZE];
bool cmp(int x,int y){
    return (b[x]+1LL)*a[y]<(b[y]+1LL)*a[x];
}
int dp[SIZE];
int main(){
    R(N,T);
    int dn=0;
    VI sp;
    REP(i,N){
        R(a[i],b[i]);
        if(a[i])d[dn++]=i;
        else {
            sp.PB(b[i]);
        }
    }
    sort(ALL(sp));
    REP(i,SZ(sp)){
        if(!i)sp[i]++;
        else{
            sp[i]+=sp[i-1]+1;
            if(sp[i]>T)sp[i]=T+1;
        }
    }
    sort(d,d+dn,cmp);
    dp[0]=0;
    int an=0;
    REP(i,dn){
        int x=d[i];
        int nxt_an=an;
        if((dp[an]+1LL)*(a[x]+1)+b[x]<=T){
            dp[++nxt_an]=(dp[an]+1LL)*(a[x]+1)+b[x];
        }
        for(int j=an-1;j>=0;j--){
            dp[j+1]=min((LL)dp[j+1],(dp[j]+1LL)*(a[x]+1)+b[x]);
        }
        an=nxt_an;
    }
    int true_an=an;
    FOR(i,0,an){
        int ll=-1,rr=SZ(sp)-1;
        while(ll<rr){
            int mm=(ll+rr+1)/2;
            if(dp[i]+sp[mm]<=T)ll=mm;
            else rr=mm-1;
        }
        true_an=max(true_an,i+ll+1);
    }
    W(true_an);
    return 0;
}


Measured memory_bytes: 13048