#include <bits/stdc++.h>
using namespace std;
int main(void) {
    int T; scanf("%d",&T);
    while (T--) {
        int n,m,p;
        scanf("%d%d%d",&n,&m,&p);
        int l=0, r=100000, ans=0;
        while (l <= r) {
            int mid=(l+r)/2;
//            printf("[%d, %d] mid = %d\n",l,r,mid);
            if (mid == 0 || (mid-1)*(m-(m*(100-p)/100))+m<=n) ans=max(ans,mid), l=mid+1;
            else r=mid-1;
        }
        printf("%d\n",ans);
    }
    return 0;
}