A string is a palindrome if it remains the same when it is read backwards. A number is palindromefree if it does not contain a palindrome with a length greater than as a substring. For example, the number is palindrome-free whereas the number is not because it contains the palindrome .
Your task is to calculate the total number of palindrome-free numbers in a given range.
The input contains two integers, and .
The output should contain one integer: the total number of palindrome-free numbers in the range (including and ).
In test cases worth points: .
Sample Input 1
Sample Output 1
Sample Input 2
Sample Output 2