#pragma GCC optimize("-Ofast","-funroll-all-loops")
#include<bits/stdc++.h>
using namespace std;
const int N = 1e6+10;
typedef long long ll;
int n,m,p;
int a[N];
int main()
{
    int T; cin>>T; while(T--){
        scanf("%d %d %d",&n,&m,&p);
    ll ans=0;
    while(n>=m){
        ans++;
        n-=m;
        n+=m*(100-p)/100;
    }
    cout<<ans<<endl;
    }
    return 0;
}