#include<bits/stdc++.h>
using namespace std;
const int MAXN=100000+5;
const int MOD=(1<<10)-1;
int n,T,m,p;
void solve()
{
     scanf("%d%d%d",&n,&m,&p);
     int Lim=m-(m*(100-p))/100;
     int lun=n/Lim,now=0,hs=0;
     if(lun<=200)
     {
        now=n;hs=0;
    }
    else
    {
        hs=lun-200;now=n-Lim*hs;
    }
    while(now>=m)
    {
        now-=Lim;
        hs++;
    }
     printf("%d\n",hs);
}
int main()
{ 
    scanf("%d",&T);
    while(T--)
        solve();
    return 0;
}