output_description: Print the number of _palindromic numbers_ among the integers between A and B
  (inclusive).
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      A B
attempt: A, B = map(str, input().split())
  La = [int(A[:3]), int(A[3:])]
  Lb = [int(B[:3]), int(B[3:])]
  L = 900 - (La[0] - 100) - (999 - Lb[0])
  ch1 = int(A[1] + A[0])
  ch2 = int(B[1] + B[0])
  if Lb[1] <= ch2:
      L -= 1
  if ch1 <= La[1]:
      L -= 1
  print(L)
  
problem_description: 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.
samples: [{"input": "11009 11332", "output": "4\n    \n\nThere are four integers that satisfy the conditions: 11011, 11111, 11211 and\n11311.\n\n* * *"}, {"input": "31415 92653", "output": "612"}]