from collections import deque, defaultdict, Counter
from bisect import bisect_left, bisect_right, insort
from itertools import permutations, combinations, groupby
from heapq import heappop, heappush
import math, sys
input = lambda: sys.stdin.readline().rstrip("\r\n")
def printl(li, sep=" "): print(sep.join(map(str, li)))
def yn(flag): print(Yes if flag else No)
_int = lambda x: int(x)-1
MOD = 100003
INF = 1<<60
Yes, No = "Yes", "No"

# B_i <- A_x_i
def _f(x, p): # O(NlogP) 使いまわすなら真面目に
    n = len(x)
    if p == 0:
        return [i for i in range(n)]
    elif p%2:
        y = _f(x, p-1)
        return [y[v] for v in x]
    else:
        y = _f(x, p//2)
        return [y[v] for v in y]

def div(num):
    left = []
    right = []
    i = 1
    while i*i <= num:
        if num%i == 0:
            left.append(i)
            if i*i < num: right.append(num//i)
        i += 1
    ret = left + right[::-1]
    return ret

def f(n):
    d = div(n)
    v = sum(d)%MOD
    return v

N, K = map(int, input().split())
P = [0]*(MOD+1)
v = f(N)
u = N
if N >= MOD: u = MOD
P[u] = v
for n in range(MOD):
    v = f(n)
    P[n] = v
Q = _f(P, K-1)
print(Q[u])