#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<cstring>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<numeric>
#include<cmath>
#include<queue>
#include<vector>
#include<set>
#include<cctype>
#include<stack>
#include<map>
typedef long long ll;
const double PI = acos(-1.0);
const int INF = 0x3f3f3f3f;
const int NINF = -INF - 1;
const int maxn = 1e5 + 10;
const double eps = 1e-9;
const int mod = 1e9 + 9;
using namespace std;
int main()
{
    int T;
    scanf("%d", &T);
    while(T--){
        double n, m, p;
        scanf("%lf%lf%lf", &n, &m, &p);
        int tmp = m * (100 - p) / 100;
        if(n < m){
            cout << 0 << endl;
            continue;
        }
        int ans = (n - m) / (m - tmp);
        ans++;
        cout << ans << endl;
    }
    return 0;
}