7月17日是Mr.W的生日，ACM-THU为此要制作一个体积为N*pi的M层生日蛋糕，每层都是一个圆柱体。



设从下往上数第i(1 <= i <= M)层蛋糕是半径为Ri, 高度为Hi的圆柱。当i < M时，要求Ri > Ri+1且Hi > Hi+1。

由于要在蛋糕上抹奶油，为尽可能节约经费，我们希望蛋糕外表面（最下一层的下底面除外）的面积Q最小。

令Q = S*pi

请编程对给出的N和M，找出蛋糕的制作方案（适当的Ri和Hi的值），使S最小-July 17 is the birthday of Mr.W, ACM-THU do this want to make a volume of N* pi M-layer birthday cake, each layer is a cylinder.



Set number　the bottom section i (1 <= i <= M) layer cake with a radius Ri, a cylindrical height of Hi. When i <M, the requirement Ri> Ri+ 1 and Hi> Hi+ 1.

Due to the cake rubbed cream, as much as possible to save funds, we hope the outer surface of the cake (the lowest layer of the underside of the exception) Q smallest area.

So that Q = S* pi

Please programming given N and M, find the cake production program (the appropriate value of Ri and Hi), the S minimum