翻译（7）

题目：FatMouse'Trade | JXNUOJ

描述：

FatMouse prepared M pounds of cat food, ready to trade with the cats guarding the warehouse containing his favorite food, JavaBean.
The warehouse has N rooms. The i-th room contains J[i] pounds of JavaBeans and requires F[i] pounds of cat food. FatMouse does not have to trade for all the JavaBeans in the room, instead, he may get J[i]* a% pounds of JavaBeans if he pays F[i]* a% pounds of cat food. Here a is a real number. Now he is assigning this homework to you: tell him the maximum amount of JavaBeans he can obtain.

胖老鼠准备了M磅的猫粮打算去和守在仓库门前的猫做交易，仓库里有他最喜欢的食物JavaBean

仓库有N个房间。第i个房间有j[i]磅的JavaBean并且需要F[i]磅的猫粮。胖老鼠不需要换完房间里所有的JavaBean，相反，如果他给F[i]* a%磅的猫粮，可能有J[i]* a%磅的JavaBean。在这里a是一个实数。现在他分给你这个任务：告诉他他能获得的JavaBean的最大值。

输入：

The input consists of multiple test cases. Each test case begins with a line containing two non-negative integers M and N. Then N lines follow, each contains two non-negative integers J[i] and F[i] respectively. The last test case is followed by two -1's. All integers are not greater than 1000.

输入包括大量组测试。每组数据在第一行包括两个正数M和N。接下来的N行，每行分开输入两个正数J[i]和F[i]。输入两个-1结束输入。所有的整数不大于1000。

输出：

For each test case, print in a single line a real number accurate up to 3 decimal places, which is the maximum amount of JavaBeans that FatMouse can obtain.

每组数据单行输出一个实数，即胖老鼠能获得的JavaBean的最大值，要求精确到小数点后三位。