#include <bits/stdc++.h>
using namespace std;
int n, m, k, l, s, t, r, p;

int main() {
  
    int T;
    cin >> T;
    while (T--) {
        cin >> n >> m >> p;
        int own=floor(m*(100.0-p)/100);
        int cost=m-own;
        int ans=(n-m)/cost;
        int now=m+(n-m)%cost;
        while(1){
            if(now<m)
                break;
            now-=m;
            now+=own;
            ans++;
        }
    
        cout<<max(ans,0)<<endl;
    }

    return 0;
}