There are squares whose digits can be rearranged to make another squares. Lets call them S2S numbers.

For example: 144 → 441

Input

Single line containing two integers X Y (Xth, Yth term in the list of S2S numbers).

Output

Print all the numbers from Xth to Yth term of S2S numbers (both inclusive).

Example

Input:
1 3

Output:
144
169
196

(Xth, Yth term <= 10^12)
(Source Code Limit= 1000B)
Note: 1 → 100 → 1 or other similar numbers are NOT S2S numbers (e.g. 9 → 900 → 9)

Try the classic version -> http://www.spoj.com/problems/SQ2SQ/