Chef taught his brother Chefu about right angled triangle and its properties. Chefu says that he has understood everything about right angled triangles. Chef wants to check learning of his brother by asking the following question "Can you find a right angled triangle whose length of hypotenuse  is H and its area is S?"
Chefu is confused how to solve it. I hope you are not. Please solve this by finding a right angled triangle with hypotenuse H and area S. If it not possible to do so, then output -1.

-----Input-----
The first line of the input contains a single integer T denoting the number of test-cases. T test cases follow.
For each test case, there will be a single line containing two space separated integers H and S.

-----Output-----
Output the answer for each test-case in a single line. If it is not possible to find such a triangle, output -1. Otherwise print 3 real numbers corresponding to the lengths of the sides of the triangle sorted in non-decreasing order. Please note that the length of the triangle sides should not differ by more than 0.01 in absolute value from the correct lengths.

-----Constraints-----
- 1 ≤ T ≤ 105
- 1 ≤ H ≤ 106
- 1 ≤ S ≤ 1012

-----Example-----
Input:4
5 6
6 10
258303 89837245228
616153 77878145466
Output:3.00000 4.00000 5.00000
-1
-1
285168.817674 546189.769984 616153.000000

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

ns = {"__name__": "__main__"}
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = "import cmath\nfrom math import ceil, floor, sqrt\ndef float_round(num, places = 0, direction = floor):\n return direction(num * (10**places)) / float(10**places)\nt=int(input())\na=float(1)\nfor i in range(t):\n s=list(map(int,input().split()))\n b=float(pow(s[0],2))\n c=float(4*pow(s[1],2))\n d = float((b**2) - (4*a*c))\n # find two solutions\n if(d==0):\n  sol1 = abs((b-cmath.sqrt(d))/(2*a))\n  # print sol1\n  #sol2 = (b+cmath.sqrt(d))/(2*a)\n  m=[]\n  m.append(float_round(sqrt(sol1),6,round))\n  m.append(float_round(sqrt(b-sol1),6,round))\n  m.append(float_round(sqrt(b),6,round))\n  m.sort()\n  for p in range(2):\n   print(m[p], end=' ')\n  print(m[2])\n  # print float_round(sqrt(sol1),6,round),float_round(sqrt(b-sol1),6,round\xa0\xa0\xa0\xa0\xa0\xa0\xa0\xa0\xa0\xa0\xa0\xa0),float_round(sqrt(b),6,round)\n elif(d>0):\n  sol1 = abs((b-cmath.sqrt(d))/(2*a))\n  sol2 = abs((b+cmath.sqrt(d))/(2*a))\n  # print abs(sol1),sol2\n  m=[]\n  m.append(float_round(sqrt(sol1),6,round))\n  m.append(float_round(sqrt(sol2),6,round))\n  m.append(float_round(sqrt(b),6,round))\n  m.sort()\n  for p in range(2):\n   print(m[p], end=' ')\n  print(m[2])\n else:\n  print(-1)"
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 25357