class Eratosthenes:
    def __init__(self, n):
        self.isPrime = [True]*(n+1)
        self.minfactor = [-1]*(n+1)
        self.isPrime[0], self.isPrime[1] = False, False
        self.minfactor[1] = 1
        for i in range(2, n+1):
            if self.isPrime[i]:
                self.minfactor[i] = i
                for j in range(i*i, n+1, i):
                    self.isPrime[j] = False
                    if self.minfactor[j] == -1:
                        self.minfactor[j] = i
    
    def factorize(self, n):
        factor = []
        while n > 1:
            p = self.minfactor[n]
            cnt = 0
            while self.minfactor[n] == p:
                n //= p
                cnt += 1
            factor.append((p, cnt))
        return factor
    
    def divisor(self, n):
        ans = [1]
        pf = self.factorize(n)
        for p, c in pf:
            L = len(ans)
            for i in range(L):
                v = 1
                for _ in range(c):
                    v *= p
                    ans.append(ans[i]*v)
        return ans

MOD = 100003
E = Eratosthenes(MOD)

N, K = map(int, input().split())

if K == 1:
    exit(print(N))

IDX = [-1]*MOD
G = [-1]*MOD
A = [-1, N, sum(E.divisor(N))%MOD]
if N < MOD:
    IDX[N] = 1
if A[-1] == A[-2]:
    exit(print(A[-1]))
IDX[A[-1]] = 2
if N < MOD:
    G[N] = A[-1]
if K == 2:
    exit(print(A[-1]))

start = -1
while True:
    nex = sum(E.divisor(A[-1]))%MOD
    nidx = IDX[A[-1]]+1
    if IDX[nex] == -1:
        IDX[nex] = nidx
        G[A[-1]] = nex
        if IDX[nex] == K:
            exit(print(nex))
        A.append(nex)
    else:
        start = nex
        K = (K-2)%(nidx-IDX[nex])
        break

for _ in range(K):
    start = G[start]

print(start)