Johnny needs to make a rectangular box for his physics class project. He has bought P cm of wire and S cm^2 of special paper. He would like to use all the wire (for the 12 edges) and paper (for the 6 sides) to make the box.
What is the largest volume of the box that Johnny can make?

Input
The first line contains t, the number of test cases (about 10). Then t test cases follow.

Each test case contains two integers P and S in a line (1 ≤ P ≤ 40000, 1 ≤ S ≤ 20000). You may assume that there always exists an optimal solution for the given input cases.


Output
For each test case, print a real number that is the largest volume of the box that Johnny can make, rounded to two decimal places.

Example

Input:
2
20 14
20 16

Output:
3.00
4.15

Output details
First case: the dimensions of the largest box may be 3, 1 and 1.
Second case: the dimensions of the largest box may be 7/3, 4/3 and 4/3.
from math import sqrt

def bestBox():
    t = int(raw_input())
    
    while (t>0):
        t-=1
        
        P,S = map(float, raw_input().split())
        
        #print "The length of the wire is: ", P, " and the area of the paper is: ", S
        
        x1 = float(0)
        z1 = float(0)
        x2 = float(0)
        z2 = float(0)
        
        x1 = (P+sqrt( P**2 - 24*S))/12
        x2 = (P-sqrt( P**2 - 24*S))/12
        
        z1 = (P - 8*x1)/4
        z2 = (P - 8*x2)/4
        
        #print "The two sets of values are: "
        #print "x1: ", x1
        #print "x2: ", x2
        #print "z1: ", z1
        #print "z2: ", z2
        
        v1 = x1 * x1 * z1
        v2 = x2 * x2 * z2
        
        print max(round(v1,2),round(v2,2))
    
    pass

bestBox()