n, p = map(int, input().split())
original_number = n
n = [int(i) for i in str(n)]

ans = [-1 for i in range(len(n))]

digit = n[len(n)-p]

for i in range(0, len(n)-p):
  ans[i] = n[i] + digit

for i in range(len(n)-p+1, len(n)):
  ans[i] = abs(n[i] - digit)

def prime_factors(number):
  if number == 1:
    return 0
  if number == 2:
    return 1
  if number == 3:
    return 1
  factors = 0
  for i in range(2, int(number**(0.5))+1):
    if number % i == 0:
      factors += 1
      while number % i == 0:
        number //= i
  if factors == 0:
    return 1
  return factors

ans[len(n)-p] = prime_factors(original_number)

ans = int(''.join([str(i) for i in ans]))
print(ans)