AT_abc387_c [ABC387C] Snake Numbers

A positive integer not less than $ 10 $ whose top digit (the most significant digit) in decimal representation is strictly larger than every other digit in that number is called a **Snake number**. For example, $ 31 $ and $ 201 $ are Snake numbers, but $ 35 $ and $ 202 $ are not. Find how many Snake numbers exist between $ L $ and $ R $ , inclusive.

The input is given from Standard Input in the following format: > $ L $ $ R $

Print the answer.

### Sample Explanation 1 The Snake numbers between $ 97 $ and $ 210 $ , inclusive, are $ 97 $ , $ 98 $ , $ 100 $ , $ 200 $ , $ 201 $ , and $ 210 $ : there are six. ### Constraints - $ 10 \leq L \leq R \leq 10^{18} $ - All input values are integers.