## Description:

people in USSS love math very much, and there is a famous math problem .

give you two integers $$$n$$$,$$$a$$$,you are required to find $$$2$$$ integers $$$b$$$,$$$c$$$ such that $$$a^{n}$$$+$$$b^{n} = c^{n} $$$.

## Input:

one line contains one integer $$$T$$$;$$$(1 \le T\le1000000)$$$

next $$$T$$$ lines contains two integers $$$n$$$,$$$a$$$;$$$(0 \le n \le1000$$$,$$$000$$$,$$$000,3 \le a \le 40000)$$$

## Output:

print two integers $$$b$$$,$$$c$$$ if $$$b$$$,$$$c$$$ exits;$$$(1 \le b,c \le 1000$$$,$$$000$$$,$$$000)$$$;

else print two integers -1 -1 instead.

## Sample Input:

1
2 3

## Sample Output:

4 5