Quadratic Permutation Junior
Consider a permutation of numbers from a to b. We will call it a quadratic permutation if, for each element, the sum of the element and the element that replaces it in the permutation is a perfect square. More specifically, a quadratic permutation is defined as a bijection p of the set of integers from a to b onto itself, such that for any integer i, the equation i + p(i) = j^2 holds for some integer j. Given a and b, your task is to find a quadratic permutation.
Constraints
a, b are integers such that 0 ≤ a ≤ b ≤ 20.
Input
The input consists of a single line containing the numbers a and b.
Output
Output b-a+1 numbers that represent the values of p(i) for all i from a to b, where p is a quadratic permutation. If no such permutation exists for the given a and b, output the single number -1.