Almost Palindromic

A string is *almost palindromic* if we can rearrange its characters in such a way that it becomes a palindrome. A positive integer is almost palindromic if its decimal representation without leading zeros is an almost palindromic string. You are given two integers $L$ and $R$. Find the number of almost palindromic integers between $L$ and $R$ (inclusive). Since this number could be very large,