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)); }


void main() {
  try {
    for (; ; ) {
      const N = readInt();
      const K = readLong();
      
      long[] ms;
      for (long i = 0, j; i < K; i = j) {
        const k = K / (i + 1);
        j = K / k;
        ms ~= k;
      }
      ms ~= 0;
      ms.sort;
      const msLen = cast(int)(ms.length);
      debug {
        if (ms.length <= 10) {
          writeln("ms = ", ms);
        }
      }
      
      auto crt = new ulong[msLen];
      crt[1 .. $] = 1;
      foreach (x; 1 .. N + 1) {
        auto nxt = new ulong[msLen];
        int f = 0;
        foreach (e; 0 .. msLen) {
          const tar = ms[e] / x;
          for (; f < msLen; ++f) {
            if (ms[f] == tar) {
              nxt[e] = crt[f];
              break;
            }
          }
        }
        crt[] += nxt[];
        debug {
          if (ms.length <= 10) {
            writeln(x, ": ", crt);
          }
        }
      }
      
      writeln(crt[$ - 1] - 1);
    }
  } catch (EOFException e) {
  }
}