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())
     ...:
     ...:
     ...: def kaibun(m, n):
     ...:     key = 0
     ...:     for i in range(m,n+1):
     ...:         s = i//10000
     ...:         t = i%10
     ...:         u = i//1000 % 10
     ...:         v = i//10 % 10
     ...:         if (s==t)&(u==v):
     ...:             key += 1
     ...:     return key
     ...:
     ...: print(kaibun(A,B))
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"}]