We'll define *S*(*n*) for positive integer *n* as follows: the number of the *n*'s digits in the decimal base. For example, *S*(893) = 3, *S*(114514) = 6.

You want to make a consecutive integer sequence starting from number *m* (*m*, *m* + 1, ...). But you need to pay *S*(*n*)·*k* to add the number *n* to the sequence.

You can spend a cost up to *w*, and you want to make the sequence as long as possible. Write a program that tells sequence's maximum length.
The first line contains three integers *w* (1 ≤ *w* ≤ 10<sup class="upper-index">16</sup>), *m* (1 ≤ *m* ≤ 10<sup class="upper-index">16</sup>), *k* (1 ≤ *k* ≤ 10<sup class="upper-index">9</sup>).

Please, do not write the %lld specifier to read or write 64-bit integers in C++. It is preferred to use the cin, cout streams or the %I64d specifier.
def power(a, b):
    return a ** b

n1, n2, n3 = list(map(int, input().split()))

ans = 0
c1 = 0
while power(10, c1) <= n2:
    c1 += 1

c2 = 0
temp = power(10, c1) - n2
while c2 + c1 * n3 * temp  < n1:
    ans += temp

    c2 += c1 * n3 * temp
    n2 = temp
    c1 += 1

    temp = power(10, c1) - n2

ans += (n1 - c2) // (c1 * n3)
print(ans)

			 			 	 	 		 		  			 				  	