Source

This problem is adapted from Long Long OJ. All rights reserved.

Problem Description

Given $S$ and $E$, for each number in the interval $[S, E]$: if it is not a palindrome number, output the number itself; otherwise, output Palindrome!.

Input Format

A single line containing two integers $S$ and $E$.

Output Format

There are a total of $E-S+1$ lines, each line containing an integer (or the specified string), with the output method as described in the problem statement.

Samples

8 13

Palindrome!
Palindrome!
10
Palindrome!
12
13

999999997 1000000000

999999997
999999998
Palindrome!
1000000000

Sample 1 Explanation

$8$, $9$, and $11$ are all palindrome numbers, so Palindrome! is output for them.

Data Range

For $100\%$ of the data, $1 \le S \le E \le 10^{18}$ and $E-S+1\le 10^5$.