#include<iostream>
#include <algorithm>
using namespace std;
int n, m, p;

int max(int a, int b){
    return a > b? a : b;
}
int main(){
    int T; cin >> T;
    while (T --){
        cin >> n >> m >> p;
        if(n < m){
            cout << "0\n";
            continue;
        }
        p = 100 - p;
        int t = m - ((m*p) / 100);
        int cnt = (n - m) / t;
        n -= cnt * t;
        while (n >= m){
            n -= t;
            cnt ++;
        }
        cout << cnt << "\n";
    } 
    return 0;
}