import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum K = 32;
alias Circle = Tuple!(long, "a", long, "b");

void main() {
  try {
    for (; ; ) {
      const N = readInt();
      const T = readLong();
      auto C = new Circle[N];
      foreach (i; 0 .. N) {
        C[i].a = readLong();
        C[i].b = readLong();
      }
      
      long[] zeros;
      Circle[] cs;
      foreach (ref c; C) {
        if (c.a == 0) {
          zeros ~= c.b + 1;
        } else {
          cs ~= c;
        }
      }
      
      zeros.sort();
      const zerosLen = cast(int)(zeros.length);
      auto zerosSum = new long[zerosLen + 1];
      foreach (j; 0 .. zerosLen) {
        zerosSum[j + 1] = zerosSum[j] + zeros[j];
      }
      debug {
        writeln("zerosSum = ", zerosSum);
      }
      
      // (b + 1) / a
      cs.sort!((c0, c1) => ((c0.b + 1) * c1.a < (c1.b + 1) * c0.a));
      
      auto dp = new long[K + 1];
      dp[] = T + 1;
      dp[0] = 0;
      foreach (ref c; cs) {
        foreach_reverse (k; 0 .. K) {
          chmin(dp[k + 1], (c.a + 1) * dp[k] + (c.a + c.b + 1));
        }
      }
      debug {
        writeln("cs = ", cs);
        writeln("dp = ", dp);
      }
      
      int ans;
      foreach (j; 0 .. zerosLen + 1) foreach (k; 0 .. K + 1) {
        if (dp[k] + zerosSum[j] <= T) {
          chmax(ans, j + k);
        }
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
