def gcd(m,n):
while m>0 and n>0:
if m < n :
n = n % m
else:
m = m % n
return m + n;
primes = [ 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67 ]
def cnt(n,m,k):
g = gcd(n,m)
total = 1
for i in range(19):
if g <= 1: break
l = 0
while g%primes[i] == 0:
g = g // primes[i]
l = l + 1
total = total * (l+1)
return total == k
n = int(input('n: '))
k = int(input('k: '))
count = 0
for m in range(1,n):
if cnt(n,m,k) != 0: count = count + 1
print(count)
ZGVmIGdjZChtLG4pOgogICAgd2hpbGUgbT4wIGFuZCBuPjA6CiAgICAgICAgaWYgbSA8IG4gOiAKICAgICAgICAgICAgbiA9IG4gJSBtCiAgICAgICAgZWxzZToKICAgICAgICAgICAgbSA9IG0gJSBuCiAgICByZXR1cm4gbSArIG47CgpwcmltZXMgPSBbIDIsIDMsIDUsIDcsIDExLCAxMywgMTcsIDE5LCAyMywgMjksIDMxLCAzNywgNDEsIDQzLCA0NywgNTMsIDU5LCA2MSwgNjcgXQoKZGVmIGNudChuLG0sayk6CiAgICBnID0gZ2NkKG4sbSkgICAgCiAgICB0b3RhbCA9IDEKCiAgICBmb3IgaSBpbiByYW5nZSgxOSk6CiAgICAgICAgaWYgZyA8PSAxOiBicmVhawogICAgICAgIGwgPSAwCiAgICAgICAgd2hpbGUgZyVwcmltZXNbaV0gPT0gMDoKICAgICAgICAgICAgZyA9IGcgLy8gcHJpbWVzW2ldCiAgICAgICAgICAgIGwgPSBsICsgMQogICAgICAgIHRvdGFsID0gdG90YWwgKiAobCsxKQogICAgcmV0dXJuIHRvdGFsID09IGsKCm4gPSBpbnQoaW5wdXQoJ246ICcpKQprID0gaW50KGlucHV0KCdrOiAnKSkKY291bnQgPSAwCmZvciBtIGluIHJhbmdlKDEsbik6CiAgICBpZiBjbnQobixtLGspICE9IDA6IGNvdW50ID0gY291bnQgKyAxCnByaW50KGNvdW50KQoK