Palindrome-Free Numbers

A string is called a palindrome if it reads the same forwards and backwards.

Write the decimal representation of an integer $A$ as a string of digits. If none of its substrings of length $2$ or more (contiguous digits) is a palindrome, then $A$ is called a palindrome-free number.

For example, $16276$ is a palindrome-free number. On the other hand, $17276$ is not, because its substring $727$ is a palindrome.

Given two integers $a$ and $b$, write a program that counts how many palindrome-free numbers lie between $a$ and $b$, inclusive.

The first line contains two integers $a$ and $b$, separated by a space. ($0 \le a \le b \le 10^{18}$)

Print, on the first line, the number of palindrome-free integers that are at least $a$ and at most $b$.