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

A,B = map(int,input().split())
#greedy O(B-A)*len(B)(=5)
kaibun = 0 # num of kaibun
for i in range(A,B+1,1):
  s = str(i)
  #print(s)
  for i in range(len(s)):
    if s[i] != s[len(s)-1-i]:
      break
    if i == len(s)-1:
      kaibun += 1
print(kaibun)