/+ dub.sdl:
	name "A"
	dependency "dcomp" version=">=0.0.2"
+/
import std.stdio, std.conv, std.algorithm;
// import dcomp.scanner;
// import dcomp.prime;

Scanner sc;
static this() {sc = new Scanner();}

int[] divlist;

int calc(int N, int X, int bc) {
    if (N == 0) {
        if (X == 1) return 1;
        return 0;
    }
    if (N == 1) {
        if (bc <= X) return 1;
        return 0;
    }
    int B = divlist[bc];
    if (bc == divlist.length.to!int) return 0;
    if (B*B > X) return 0;
    int ans = calc(N, X, bc+1);
    if (X % B == 0) {
        ans += calc(N-1, X/B, bc);
    }
    return ans;
}

int main() {
    int N, X;
    sc.read(N, X);
    X++;
    divlist = factorList(X);

    writeln(calc(N, X, 1));
	return 0;
}
/* IMPORT /Users/yosupo/Program/dcomp/source/dcomp/scanner.d */
// module dcomp.scanner;

class Scanner {
    import std.stdio : File, readln, stdin;
    import std.conv : to;
    import std.range : front, popFront, array, ElementType;
    import std.array : split;
    import std.traits : isSomeString, isDynamicArray;
    import std.algorithm : map;
    File f;
    this(File f = stdin) {
        this.f = f;
    }
    string[] buf;
    bool succ() {
        while (!buf.length) {
            if (f.eof) return false;
            buf = readln.split;
        }
        return true;
    }
    int read(Args...)(auto ref Args args) {
        foreach (i, ref v; args) {
            if (!succ()) return i;
            alias VT = typeof(v);
            static if (!isSomeString!VT && isDynamicArray!VT) {
                v = buf.map!(to!(ElementType!VT)).array;
                buf.length = 0;
            } else {
                v = buf.front.to!VT;
                buf.popFront();
            }
        }
        return args.length;
    }
}
/* IMPORT /Users/yosupo/Program/dcomp/source/dcomp/prime.d */
// module dcomp.prime;

T[] factorList(T)(T x) {
    import std.algorithm : sort;
    T[] res;
    for (int i = 1; i*i <= x; i++) {
        if (x%i == 0) {
            res ~= i;
            if (i*i != x) res ~= x/i;
        }
    }
    sort(res);
    return res;
}