#include <iostream>
using namespace std;

int main() {
  int A,B,count=0;
  cin >> A >> B;
  do
    if((B/100)==((B%10)*100+(B/10%10)*10+(B/100%10)))
      ++count;
  while((--B)>=A);
  cout << count << endl;
}

### Prompt

Your task is to create a Cpp solution to the following problem:

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).

Examples

Input

11009 11332


Output

4


Input

31415 92653


Output

612

### Response

```cpp
#include <iostream>
using namespace std;

int main() {
  int A,B,count=0;
  cin >> A >> B;
  do
    if((B/100)==((B%10)*100+(B/10%10)*10+(B/100%10)))
      ++count;
  while((--B)>=A);
  cout << count << endl;
}

```