#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<memory.h>
typedef long long ll;
#define Maxn 105
int M[Maxn];
double Pr[Maxn];
double dp[Maxn*Maxn];
using namespace std;
int main()
{ int T,N,i,j,sum;
double P;
scanf("%d",&T);
while(T--)
{ memset(dp,0,sizeof(dp));
sum=0;
scanf("%lf%d",&P,&N);
for( i=0;i<N;i++)
{scanf("%d%lf",&M[i],&Pr[i]);sum+=M[i];}
dp[0]=1;
for(i=0;i<N;i++)
for(j=sum;j>=M[i];j--)
// dp[j]=min(dp[j]+pr[i],dp[j-M[i]]);
dp[j]=max(dp[j],dp[j-M[i]]*(1-Pr[i]));
for(i=sum;i>=0;i--)
if(1-dp[i]<P){printf("%d\n",i);break;}
}
return 0;
}