# a, b, k = map(int, input().split())
#
# c = 0
#
# n = 1
# c = c + b // 10 + 1 # 1의 자리
# if a >= k:
# c = c - a // 10
# if a % 10 > k or k > b % 10:
# c = c - 1
#
# n = 10
# if b > n - 1 and b >= n * k: # 10의 자리
# c = c + ((b // 100) * n + (b % n)) + 1
# if a >= n * k:
# c = c - ((a // 100) * n + (a % 10))
# if a - a % 10 > n k and ((a // 100) 100 + n * k) >= a:
# c = c + a % 10
# if (a // n) % 10 > k:
# c = c - n + a % n
# if (b // n) % 10 < k:
# c = c - b % n - 1
#
# n = 100
# if b > n - 1 and b >= n * k: # 100의 자리
# c = c + ((b // 1000) * n + b % n) + 1
# if a >= n * k:
# c = c - ((a // 1000) * n + a % n)
# if a - a % 10 > n k and ((a // 1000) 1000 + n * k + a % n - a % 10) >= a:
# c = c + a % 10
# if (a // n) % 10 > k:
# c = c - n + a % n
# if (b // n) % 10 < k:
# c = c - b % n - 1
# ***********
# n = 1000
# if b > 999 and b >= n * k: # 1,000의 자리
# c = c + ((b // 10000) * 1000 + b % 1000) + 1
# if a >= 1000 * k:
# c = c - ((a // 10000) * 1000 + a % 1000)
# if a - a % 10 > 1000 k and ((a // 10000) 10000 + 1000 * k + a % 1000 - a % 10) >= a:
# c = c + a % 10
# if (a // 1000) % 10 > k:
# c = c - 1000 + a % 1000
# if (b // 1000) % 10 < k:
# c = c - b % 1000 - 1
#
# if b > 9999 and b >= 10000 * k: # 10,000의 자리
# c = c + ((b // 100000) * 10000 + b % 10000) + 1
# if a >= 10000 * k:
# c = c - ((a // 100000) * 10000 + a % 10000)
# if a - a % 10 > 10000 k and ((a // 100000) 100000 + 10000 * k + a % 10000 - a % 10) >= a:
# c = c + a % 10
# if (a // 10000) % 10 > k:
# c = c - 10000 + a % 10000
# if (b // 10000) % 10 < k:
# c = c - b % 10000 - 1
#
# if b > 99999 and b >= 100000 * k: # 100,000의 자리
# c = c + ((b // 1000000) * 100000 + b % 100000) + 1
# if a >= 100000 * k:
# c = c - ((a // 1000000) * 100000 + a % 100000)
# if a - a % 10 > 100000 k and ((a // 1000000) 1000000 + 100000 * k + a % 100000 - a % 10) >= a:
# c = c + a % 10
# if (a // 100000) % 10 > k:
# c = c - 100000 + a % 100000
# if (b // 100000) % 10 < k:
# c = c - b % 100000 - 1
#
# if b > 999999 and b >= 1000000 * k: # 1,000,000의 자리
# c = c + ((b // 10000000) * 1000000 + b % 1000000) + 1
# if a >= 1000000 * k:
# c = c - ((a // 10000000) * 1000000 + a % 1000000)
# if a - a % 10 > 1000000 k and ((a // 10000000) 10000000 + 1000000 * k + a % 1000000 - a % 10) >= a:
# c = c + a % 10
# if (a // 1000000) % 10 > k:
# c = c - 1000000 + a % 1000000
# if (b // 1000000) % 10 < k:
# c = c - b % 1000000 - 1
#
# if b > 9999999 and b >= 10000000 * k: # 10,000,000의 자리
# c = c + ((b // 100000000) * 10000000 + b % 10000000) + 1
# if a >= 1000000 * k:
# c = c - ((a // 100000000) * 10000000 + a % 10000000)
# if a - a % 10 > 10000000 k and ((a // 100000000) 100000000 + 10000000 * k + a % 10000000 - a % 10) >= a:
# c = c + a % 10
# if (a // 10000000) % 10 > k:
# c = c - 10000000 + a % 10000000
# if (b // 10000000) % 10 < k:
# c = c - b % 10000000 - 1
#
# if b > 99999999 and b >= 100000000 * k: # 100,000,000의 자리
# c = c + ((b // 1000000000) * 100000000 + b % 100000000) + 1
# if a >= 10000000 * k:
# c = c - ((a // 1000000000) * 100000000 + a % 100000000)
# if a - a % 10 > 100000000 k and ((a // 1000000000) 1000000000 + 100000000 * k + a % 100000000 - a % 10) >= a:
# c = c + a % 10
# if (a // 100000000) % 10 > k:
# c = c - 100000000 + a % 100000000
# if (b // 100000000) % 10 < k:
# c = c - b % 100000000 - 1
# if c < 0 :
# print('0')
# else:
# print(c)
# a, b, k = map(int, input().split())
#
# c = 0
# n = 1
#
# c = c + b // 10 + 1
# if a >= k:
# c = c - a // 10
# if a % 10 > k:
# c = c - 1
# if k > b % 10:
# c = c - 1
# n = 10
#
# while n <= 100000000:
# q = c
# m = 0
# if b > n - 1 and b >= n * k:
# c = c + ((b // (10 n)) n + b % n) + 1
# if k < b // n - 10 (b // (10 n)) and k != 0:
# c = c + n - b % n - 1
#
# if k == 0 and ((a // (10 n)) 10 * n + a % n) < n:
# c = c - n
# m = 1
# elif a >= n * k:
# c = c - ((a // (10 n)) n + a % n)
# if a - a % 10 > n k and ((a // (10 n)) 10 n + n * k + a % n - a % 10) >= a:
# c = c + a % n
# if (a // n) % 10 > k and m == 0:
# c = c - n + a % n
# if (b // n) % 10 < k:
# c = c - b % n - 1
# if c < q:
# c = q
# n = n * 10
#
# if c < 0:
# print('0')
# else:
# print(c)
# def f(n):
# if n == 1:
# return 1
# return 2 * f(n - 1) + 1
#
#
# n = int(input())
# print(f(n))
# import sys
# limit_number = 2000000000
# sys.setrecursionlimit(limit_number)
#
#
# def f(i, j):
# global d
# if i == 0 or j == 0 or i == j:
# d[i][j] = 1
# return 1
# if d[i][j] != 0:
# return d[i][j]
# d[i][j] = f(i - 1, j - 1) + f(i - 1, j)
# return d[i][j]
#
#
# n = int(input())
# d = []
# for i in range(n):
# v = [0] * (i + 1)
# d.append(v)
#
# for i in range(n):
# for j in range(i + 1):
# print(f(i, j), end=' ')
# print()
# def f(k):
# global d, c, n
# if k == n - 1:
# c[k] = 1
# return 1
# if c[k] != 0:
# return c[k]
# max = 0
# for i in range(k, n):
# if d[k] < d[i]:
# if f(i) > max:
# max = f(i)
#
# c[k] = max + 1
# return c[k]
#
#
# n = int(input())
# d = list(map(int, input().split()))
# c = [0] * len(d)
# m = 0
# for i in range(n - 1, -1, -1):
# if m < f(i):
# m = f(i)
#
# print(m)
# import sys
# limit_number = 2000000000
# sys.setrecursionlimit(limit_number)
#
#
# def f(i, j):
# global n, d, c
# if i == 0:
# c[i][j] = d[i][j]
# return c[i][j]
# if c[i][j] != 0:
# return c[i][j]
# m = 999999999999
# for h in range(3):
# if h == j:
# continue
# if f(i - 1, h) < m:
# m = c[i - 1][h]
# c[i][j] = m + d[i][j]
# return c[i][j]
#
#
# n = int(input())
# d = []
# c = []
# for i in range(n):
# v = list(map(int, input().split()))
# d.append(v)
# v1 = [0] * 3
# c.append(v1)
#
# ma = 999999999999999999
# for j in range(3):
# if f(n - 1, j) < ma:
# ma = f(n - 1, j)
# print(ma)
# def f(n, fro, tmp, to):
# if n == 1:
# print('Disk 1 :', fro, 'to', to)
# else:
# f(n - 1, fro, to, tmp)
# print('Disk', n, ':', fro, 'to', to)
# f(n - 1, tmp, fro, to)
#
#
# n = int(input())
# f(n, 'A', 'B', 'C')