#include <stdio.h>
#include<algorithm>
#include<cstring>
#define INF 1<<20
double dp[10003];
using std::min;
int n,m;
int main()
{
//freopen("input.txt","r",stdin);
while(~scanf("%d%d",&n,&m)&&(m+n))
{
double w;int v;
for(int i=n;i>=1;i--)dp[i]=INF;
dp[0]=1;
int ok=0;
for(int i=1;i<=m;i++)
{
scanf("%d%lf",&v,&w);
if(w>=1.0)ok=1;
w=1-w;
for(int j=n;j>=v;j--)
{
dp[j]=min(dp[j],dp[j-v]*w);
}
}
double ans=1;
for(int i=0;i<=n;i++)
if(ans>dp[i])ans=dp[i];
ans=1-ans;
ans*=100;
if(ok)ans=100;
printf("%.1lf%%\n",ans);
}
return 0;
}