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(int input().split())
  cou = B//100 - A//100
  Astr = str(A)
  Aup = 10 * int(Astr[1]) + int(Astr[0])
  Adown = A%100
  Bstr =str(B)
  Bup = 10 * int(Bstr[1]) + int(Bstr[0])
  Bdown = B%100
  if Adown < Aup :
      cou += 1
  if Bdown > Bup :
      cou += 1
  print(cou)
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"}]