Absolute Prime

Problem Description

If a two-digit number is prime, and remains prime after swapping its two digits, it is called an absolute prime, for example $13$. Given two positive integers $A, B$, find all absolute primes that are greater than or equal to $A$ and less than or equal to $B$.

Input Format

The input is $1$ line containing two positive integers $A$ and $B$. It is guaranteed that $10 < A < B < 100$.

Output Format

Several lines, each containing one absolute prime, output in ascending order.

Sample Input

11 20

Sample Output

11
13
17

Sample Explanation

For the input $A = 11$, $B = 20$, the two-digit numbers in the range $[11, 20]$ are $11, 12, 13, 14, 15, 16, 17, 18, 19, 20$. Among them the primes are $11, 13, 17, 19$. Check whether each is an absolute prime:

• $11$ is prime, and reversed it is still $11$ (prime), so $11$ is an absolute prime.
• $13$ is prime, and reversed it is $31$ (prime), so $13$ is an absolute prime.
• $17$ is prime, and reversed it is $71$ (prime), so $17$ is an absolute prime.
• $19$ is prime, and reversed it is $91$, but $91 = 7 \times 13$ is not prime, so $19$ is not an absolute prime.

Therefore the final output is $11, 13, 17$.

Constraints

$10 < A < B < 100$, i.e. all numbers involved are two-digit numbers. It is guaranteed that $A, B$ and the primes sought are all within $[10, 99]$.