#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

void Solve() {
    int n, m, p;
    scanf("%d%d%d", &n, &m, &p);
    if(n < m) {
        puts("0");
        return;
    }
    int x = m - (m * (100 - p) / 100);
    int ans = (n - m) / x;
    n -= x * ans;
    while(n >= m) {
        n -= x;
        ans++;
    }
    printf("%d\n", ans);
}

int main() {
    int test;
    scanf("%d", &test);
    for(int TT = 1; TT <= test; TT++) Solve();
}