Problems
The minimal sum of digits
The minimal sum of digits
How many positive integers from interval $[m, n]$ have the least sum of digits?
\InputFile
Two integers $m$ and $n~(1 \le m \le n \le 10^6)$.
\OutputFile
Print the amount of positive integers from interval $[m, n]$ with minimum sum of digits.
Input example #1
1 100
Output example #1
3