#include<algorithm>
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;


int main()
{
    int T;
    cin>>T;
    while(T--){
        int n,m,p;
        scanf("%d%d%d",&n,&m,&p);
        //n  每次最少m
        //n-m+m(1-p%)
        //  n-m*p%>=m
        int num_puts=0;
        while(n>=m){
            num_puts++;
            double x;
            x=(double)n-(double)m*p*0.01;
            n=(int)x;
        }
//        printf("%d\n",(double)m/((double)n-0.01*p));
        printf("%d\n",num_puts);
    }
    return 0;
}