#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<queue>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
const int maxn = 2000 + 100;
const int mod = 1e9 + 7;
#define f(x) (x+x)
typedef long long ll;

int main(){
    int t;
    scanf("%d", &t);
    while(t--){
        int n, m, p;
        scanf("%d%d%d", &n, &m, &p);
        int tt = (int)((100-p)*m*0.01);
        int pp = (m - tt);
        int k = 0;
        while(n >= m){
            k++;
            n -= pp;
        }
        printf("%d\n", k);
        /*if(n-m < 0) {
            printf("0\n");
            continue;
        }
        if((n-m)%pp == 0)
         printf("%d\n", (n-m)/pp+1);
        else{
            int k = (n-m)/pp;
            int sum = m + (n-m)%pp;
            while(sum >= m){
                k++;
                sum -= pp;
            }
            printf("%d\n", k);
        }*/
    }
    return 0;
}