The minimal sum of digits

How many positive integers from interval $[m,n]$ have the least sum of digits?

Input

Two integers $m$ and $n(1\le m\le n\le 10^6)$.

Output

Print the amount of positive integers from interval $[m,n]$ with minimum sum of digits.

Examples