import sys

sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 63)
md = 10**9+7
# md = 998244353

N,K=LI()

if N==1 or K==1:
    print(1)
    exit()

dp={}
stack=[(N,K)]
while stack:
    n,k=stack.pop()
    res=0
    if n==2:
        res+=2
    elif (n-1,k) in dp:
        res+=dp[n-1,k]
    else:
        stack.append((n,k))
        stack.append((n-1,k))
    if k>=n:
        if k//n==1 or n==2:
            res+=2
        elif (n-1,k//n) in dp:
            res+=dp[n-1,k//n]
        else:
            stack.append((n,k))
            stack.append((n-1,k//n))
    dp[n,k]=res

print(dp[N,K]-1)