#include <cstdio>
#include <algorithm>
#include <iostream>
#include <cmath>
#include <cstring>
#include <vector>
#include <queue>
#include <string>
#include <map>
using namespace std;

typedef long long ll;
const double pi=acos(-1.0);
const int inf = 0x3f3f3f3f;
const ll mod=1000000007;
const int maxn=50050;
const ll N=11;
const double pai=3.14159265358979;
const ll maxn2=1e3+2;
#define mem(a,b) memset(a,b,sizeof(a))
const int MAXN=3e7;
ll t,n,m,ans,num,sum,p;
int main()
{
    int t;
    cin >> t;
    int n,m,p;
    for (int i=1;i<=t;i++)
    {
        cin >> n >> m >> p;
        int ans=0;
        while(n>=m)
        {
            n=n-m;
            n=n+(1-p*0.01)*m;
            ans++;
        }
        cout << ans << endl;
    }
    return 0;
}