class LoopDetection:
	def __init__(self,init,f):
		self.init=init
		self.f=f
		self.value=[]
		self.value_inv={}
		self.loop_start=-1
		self.loop_length=-1

	def IteratedComposition(self,n):
		L=len(self.value)
		if L<1:self.SetValue(self.init)
		if n<L:return self.value[n]
		if self.loop_start!=-1:return self.value[self.loop_start+(n-self.loop_start)%self.loop_length]
		self.SetValue(self.f(self.value[-1]))
		return self.IteratedComposition(n)

	def SearchLoop(self):
		n=0
		while self.loop_length==-1:self.IteratedComposition(n);n+=1
		return

	#private
	def SetValue(self,i):
		L=len(self.value)
		if i in self.value_inv:
			self.loop_start=self.value_inv[i]
			self.loop_length=L-self.loop_start
		else:
			self.value.append(i)
			self.value_inv[i]=L
		return

R=range
O=print
N,K=map(int,input().split())
if K<2:exit(O(N))
B=100003
C=[0]*B
for d in R(1,B):
	for n in R(d,B,d):C[n]=(C[n]+d)%B
D=0
for d in R(1,N+1):
	if N<d*d:break
	if N%d<1:
		if N>d*d:D+=d+N//d
		else:D+=d
O(LoopDetection(D%B,lambda n:C[n]).IteratedComposition(K-2))