#include #include #include #include #include #include #include #include #include #include #include using namespace std; #define ll long long ll gcd(ll a,ll b){return b?gcd(b,a%b):a;} ll qpow(ll a,ll b,ll mod=1e18+7){ll ans=1;while(b){if(b&1)ans=ans*a%mod;a=a*a%mod;b=b>>1;}return ans;} bool isPrime(ll x){if(x==2)return true;for(ll i=2;i*i<=x;++i)if(x%i==0)return false;return x>1;} int main(){ int t; cin>>t; while(t--){ ll n,m,p; cin>>n>>m>>p; ll ans=0; while(m<=n){ ans++; n-=m*p*1.0/100; } cout<