#!/usr/bin/python2
# -*- coding: utf-8 -*-
# †
def divisors(n):
    sq = int(n ** .5)
    res = [(i, n//i) for i in range(2, sq+1) if n%i==0]
    return res

N, x = map(int, raw_input().split())
sett = set()
seen = set()

def rec(n, arr):
    global sett
    key = tuple(sorted(arr))
    if n == N:
        sett.add(key)
        return
#    arr.sort()
    if key in seen:
        return
    seen.add(key)
    for i in xrange(n):
        x = arr[i]
        arr.pop(i)
        divs = divisors(x+1)
        for p, q in divs:
            arr.append(p-1)
            arr.append(q-1)
            rec(n+1, arr)
            arr.pop()
            arr.pop()
        arr.insert(i, x)

rec(1, [x])
print len(sett)