n,k=map(int,input().split())
if k==1:
  exit(print(n))
M=100003
m=max(n+1,M)
t=[0]*m
for i in range(1,m):
  for j in range(1,int(i**.5)+1):
    if i%j==0:
      t[i]+=j
      if j*j!=i:
        t[i]+=i//j
      t[i]%=M
i=n
q=[]
s=[0]*m
while s[i]<1:
  s[i]=1
  q+=i,
  i=t[i]
for j in range(len(q)):
  if q[j]==i:
    p=j
    r=q[j:]
    break
# print('#',q,r)
k-=1
if k<len(q):
  exit(print(q[k]))
k-=p
k%=len(r)
print(r[k])