from math import isqrt

mod = 100003

n,k = list(map(int,input().split()))

if k == 1:
    print(n)
    exit()

k -= 1

a = [0 for i in range(mod)]

for i in range(1,mod):
    for u in range(i,mod,i):
        a[u] += i
        a[u] %= mod

c = 0

for i in range(1,isqrt(n)+1):
    if n % i == 0:
        if i**2 != n:
            c += n//i
        c += i
        c %= mod

order = []
s = [0 for i in range(mod)]
s[c] = 1
d = {s[c]:c}

while s[a[c]] == 0:
    s[a[c]] = s[c]+1
    c = a[c]
    d[s[c]] = c

if k <= s[a[c]]:
    ans = d[k]

else:
    k -= s[a[c]]
    k %= s[c]-s[a[c]]+1
    ans = d[s[a[c]]+k]

print(ans)