找出蛋糕的制作方案（适当的Ri和Hi的值），使S最小。

输入

有两行，第一行为N（N<=10000），表示待制作的蛋糕的体积为Nπ；第二行为M(M<=20)，表示蛋糕的层数为M。

输出

仅一行，是一个正整数S（若无解则S=0）。-Find recipe program (appropriate value of Ri and Hi), the S minimum. Enter the two lines, first line N (N < = 10000), said to be the volume of cake produced Nπ　second line M (M < = 20), that the cake layers for the M. Output only line, is a positive integer S (without solutions is S = 0).