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 2.0.3) (judge verdict: Accepted)

(defun f (p)
  (concatenate 'list (write-to-string p)))


(defun g (lst)
  (if (and (char= (car lst) (car (reverse lst)))
           (char= (cadr lst) (cadr (reverse lst))))
    t
    nil))


(let ((a (read))
      (b (read)))

  (format t "~A~%"
          (loop for i from a to b
                when (g (f i))
                count i)))