You've got a rectangular parallelepiped with integer edge lengths. You know the areas of its three faces that have a common vertex. Your task is to find the sum of lengths of all 12 edges of this parallelepiped.
The first and the single line contains three space-separated integers — the areas of the parallelepiped's faces. The area's values are positive ( &gt; 0) and do not exceed 10<sup class="upper-index">4</sup>. It is guaranteed that there exists at least one parallelepiped that satisfies the problem statement.
import math
t=int(input())
while t>0:
    t-=1
    c=0
    #n=int(input())
    a,b,c=map(int,input().split())
    s1=math.sqrt((b*c)//a)
    s2=math.sqrt((a*c)//b)
    s3=math.sqrt((a*b//c))
    #print(s1,s2,s3)
    p=((s1+s2+s3)*4)
    p=int(p)
    print(p)
    
    
    
                
    
        
            
                
    
      
   
