import sys
sys.setrecursionlimit(10**6)
import pypyjit
pypyjit.set_param('max_unroll_recursion=-1')
from math import lcm

K, N = map(int, input().split())

LCM = [1]
for i in range(2, 25):
    LCM.append(lcm(LCM[-1], i))
L = LCM[-1]
P = [1]
for i in range(2, 25):
    P.append(P[-1]*i)

def func(n, R, c, a):
    if n == 0:
        return a
    ans = 0
    for i in range(min(n+1, c+1)):
        r = R-L//n*i
        if r < 0:
            break
        if n >= 2 and r%(L//LCM[n-2]) == 0 or n == 1 and r == 0 and c == i:
            cnt[n-1] += i
            ans += func(n-1, r, c-i, a//P[i-1] if i >= 1 else a)
            cnt[n-1] -= i
    return ans

cnt = [0]*N
print(func(N, L, K, P[K-1]))