import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, 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; }

void chmin(T)(ref T t, in T f) { if (t > f) t = f; }
void chmax(T)(ref T t, in T f) { if (t < f) t = f; }

int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }


int N;
long X;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      X = readLong() + 1;
      long[] divs;
      for (long d = 1; d * d <= X; ++d) {
        if (X % d == 0) {
          divs ~= d;
          if (d != X / d) {
            divs ~= X / d;
          }
        }
      }
      divs.sort;
      const divsLen = cast(int)(divs.length);
      auto ks = new int[][divsLen];
      auto quot = new int[][](divsLen, divsLen);
      foreach (j; 0 .. divsLen) {
        foreach (k; 0 .. divsLen) {
          if (divs[k] % divs[j] == 0) {
            ks[j] ~= k;
            quot[j][k] = divs.lowerBound(divs[k] / divs[j]);
          }
        }
      }
      debug {
        writeln("divs = ", divs);
        writeln("ks = ", ks);
        writeln("quot = ", quot);
      }
      auto dp = new long[][](N + 1, divs.length);
      dp[0][0] = 1;
      foreach (j; 1 .. divsLen) {
        foreach (i; 0 .. N) {
          foreach (k; ks[j]) {
            dp[i + 1][k] += dp[i][quot[j][k]];
          }
        }
        debug {
          writeln(dp);
        }
      }
      writeln(dp[N][divsLen - 1]);
    }
  } catch (EOFException e) {
  }
}