A. Number Of Palindromes
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Given two integers $$$L$$$ and $$$R$$$, print how many numbers $$$x$$$ such that $$$x$$$ is a palindrome number and $$$(L \le x \le R)$$$.

We say that number $$$x$$$ is palindrome if it is integer and reads the same from left to right and right to left.

For example:

Number $$$101$$$ is palindrome because if we reverse $$$101$$$ it will be the same

Number $$$1010$$$ is not palindrome because if we reverse $$$1010$$$ it will be $$$0101$$$.

Number $$$1221$$$ is palindrome because if we reverse $$$1221$$$ it will be the same.

Input

Only one line contains two integers $$$L$$$ and $$$R$$$ where $$$(1 \le L \le R \le 10^6)$$$.

Output

Print how many numbers $$$x$$$ such that $$$x$$$ is a palindrome number and $$$(L \le x \le R)$$$.

Examples
Input
1 9
Output
9
Input
1 10
Output
9
Input
12 16
Output
0