#include <iostream>
#include<stdio.h>
#include<algorithm>
#include<string>
#include<iomanip>
using namespace std;
struct cc
{
double c;
int a,b;
} f[999999];
bool cmp(cc x,cc y)
{
return x.c>y.c;
}
int main()
{
int n,i,m;
double a,b;
while(~scanf("%d%d",&m,&n))
{
if(m==-1&&n==-1)
break;
double sum=0;
for(i=0;i<n;i++)
{
scanf("%d%d",&f[i].a,&f[i].b);
f[i].c=f[i].a*1.0/f[i].b;
}
sort(f,f+n,cmp);
for(i=0;i<n;i++)
{
if(f[i].b<=m)
{
sum+=f[i].a;
m-=f[i].b;
}
else if(m<=f[i].b&&m>0)
{
sum=sum+f[i].c*m;
break;
}
}
printf("%.3lf\n",sum);
}
return 0;
}