跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F2229. Making Sequences is Fun

    ID: 2235 传统题 2000ms 256MiB 尝试: 0 已通过: 0 难度: 4 上传者: 标签>二分模拟数学算法思想编程与模拟进阶难度共享题库Codeforces英文题面题目来源题面语言

Making Sequences is Fun

题目描述

B. Making Sequences is Fun
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

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(nk 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.

Input

The first line contains three integers w (1≤w≤1016), m (1≤m≤1016), k (1≤k≤109).

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.

Output

The first line should contain a single integer − the answer to the problem.

Examples
Input
9 1 1
Output
9
Input
77 7 7
Output
7
Input
114 5 14
Output
6
Input
1 1 2
Output
0

题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 1835 题。保留原作者与原赛事署名。