# The minimal sum of digits

Very easy

Execution time limit is 1 second

Runtime memory usage limit is 128 megabytes

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

## Input

Two integers $m$ and $n(1≤m≤n≤10_{6})$.

## Output

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

## Examples

Input #1

Answer #1

Submissions 11K

Acceptance rate 45%