class BIT:
    def __init__(self, n):
        self.n = n
        self.bit = [0]*(self.n+1) # 1-indexed

    def init(self, init_val):
        for i, v in enumerate(init_val):
            self.add(i, v)

    def add(self, i, x):
        # i: 0-indexed
        i += 1 # to 1-indexed
        while i <= self.n:
            self.bit[i] += x
            i += (i & -i)

    def sum(self, i, j):
        # return sum of [i, j)
        # i, j: 0-indexed
        return self._sum(j) - self._sum(i)

    def _sum(self, i):
        # return sum of [0, i)
        # i: 0-indexed
        res = 0
        while i > 0:
            res += self.bit[i]
            i -= i & (-i)
        return res

    def lower_bound(self, x):
        s = 0
        pos = 0
        depth = self.n.bit_length()
        v = 1 << depth
        for i in range(depth, -1, -1):
            k = pos + v
            if k <= self.n and s + self.bit[k] < x:
                    s += self.bit[k]
                    pos += v
            v >>= 1
        return pos

    def __str__(self): # for debug
        arr = [self.sum(i,i+1) for i in range(self.n)]
        return str(arr)

n, s = map(int, input().split())
R = []
for d in range(1, s+1):
    r = n%d
    n = n//d
    R.append(r)
A = list(range(1, s+1))
B = []
for i in reversed(range(s)):
    k = R[i]
    B.append(A[k])
    A.pop(k)

B = [b-1 for b in B]
C = [-1]*s
for i, b in enumerate(B):
    C[b] = i

fac = [0]*21
fac[0] = 1
for i in range(1, 21):
    fac[i] = fac[i-1]*i

bit = BIT(s+2)
for c in C:
    bit.add(c, 1)

ans = 0
for i, c in enumerate(C):
    x = bit.sum(0, c)
    ans += x*fac[s-i-1]
    bit.add(c, -1)

print(ans)