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 Common Lisp (SBCL 1.1.14) (judge verdict: Accepted)

(defun int-to-digit (n &key (base 10)) ;; (int-to-digit 123) => (1 2 3)
  (if (zerop n)
      `(0)
      (labels ((rec (n list)
                 (if (= n 0)
                     list
                     (rec (floor n base) (cons (rem n base) list)))))
        (rec n nil))))

(defun palindromep (n &key (base 10)) ;; (palindromep 12321) => t
  (equal (reverse (int-to-digit n :base base)) (int-to-digit n :base base)))

(defun solver ()
  (let ((a (read)) (b (read)) (count 0))
    (loop for i from a to b do
          (when (palindromep i)
            (incf count)))
    (format t "~a~%" count)))

(solver)