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 Pascal (FPC 2.6.2) (judge verdict: Accepted)

Uses math;
var a,b,c:longint;
begin
	read(a,b);
	for a:=a to b do begin
		if (a mod 10 = floor(a/10000)) and (floor(a/10)mod 10 = floor(a/1000)mod 10) then c:=c+1;
	end;
	write(c)
end.