m = int(input()) n = int(input()) if n > m: print(0) exit() mod = 10**8 def e(n): #O(NloglogN) l = [i for i in range(n+1)]*(n+1) for i in range(2,n): if l[i] == i: for p in range(i+i,n+1,i): l[p] = i return l p = e(m+10) from collections import defaultdict d = defaultdict(int) for i in range(n): now = m-i while now != 1: d[p[now]] += 1 now //= p[now] i += 1 while i != 1: d[p[i]] -= 1 i //= p[i] ans = 1 for k,v in d.items(): ans *= pow(k,v,mod) ans %= mod ans = str(ans) print("0"*(8-len(ans)) + ans)