Formatting#5234

Formatting

0.5 seconds

16 megabytes

Easy

Rybka is going to format Watson's hard drive partition. This partition should contain $N$ sectors, sequentially numbered with decimal integers starting from $A$ . How many digits does Rybka need to label all the sectors?

Input

The input consists of two positive integers $N$ and $A$ ( $1 \leq N, A \leq 1 0^{8}$ 1 \le N, A \le 10^8).

Output

Print the number of digits required for labeling all the sectors.

Examples

Example 1

Loading

1 \leq N, A \leq 1 0^{8}