317 - Roads


Time Limit: 1 sec


The Problem

S daily goes to school by walking N km. But he always get late. For this reason he divided the Time in four parts. In first part he walks at the speed of M km. Second part his speed reduce 2 times. Third part his speed reduce 3 times. And in four part his speed reduce 5 times. After this he reaches school on time.

Your task is to find the Total Path, N.


The Input

Input file contains a series of line. Each line contains two integer numbers, the total time T (T<1000) and speed, M (M<100). Input is terminated by EOF


The Output

For each line of input print the total Path, N which S is taken for going school rounded to 2 decimal points in a separate line.


Sample Input

97 97

350 50

422 22


Sample Output








Problem Setter: Samia Safa Ahmed