Problem:
Score : 200 points

Problem Statement

Find the number of palindromic numbers among the integers between A and B (inclusive).
Here, a palindromic number is a positive integer whose string representation in base 10 (without leading zeros) reads the same forward and backward.

Constraints

10000 \leq A \leq B \leq 99999

All input values are integers.

Input

Input is given from Standard Input in the following format:

A B

Output

Print the number of palindromic numbers among the integers between A and B (inclusive).

Sample Input 1

11009 11332

Sample Output 1

4

There are four integers that satisfy the conditions: 11011, 11111, 11211 and 11311.

Sample Input 2

31415 92653

Sample Output 2

612

Solution in Haskell (GHC 7.10.3) (judge verdict: Wrong Answer)

import qualified Data.ByteString.Char8 as BS
import Data.Maybe
import Control.Monad

readInt = fst . fromJust . BS.readInt
readIntList = map readInt . BS.words

getIntList = readIntList <$> BS.getLine

getKaiNum :: [[Int]] -> Int -> Int -> Int
getKaiNum [] a b = 0
getKaiNum (x:xs) a b = m + getKaiNum xs a b
  where
    [s, t] = x
    s' = show s
    t' = show t
    n = read (s' ++ t' ++ reverse s') :: Int
    m = if n > a && n <= b then 1 else 0

main = do
  [a, b] <- getIntList
  let xs = sequence [[10..99], [0..9]]
  print $ getKaiNum xs a b