/*#include <iostream>
#include <algorithm>
using namespace std;

int a[100010];
int main() {
    int T;  scanf("%d", &T);
    while (T--) {
        int n; scanf("%d", &n);
        for (int i = 0; i < n; i++) scanf("%d", &a[i]);
        sort(a, a + n);
        long long ans = 0;
        for (long long i = 1; i < n; i++) {
            ans += (n - i) * (a[i] - a[0]);
        }
        cout << ans << endl;
    }
    return 0;
}*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxx = 1e6 + 7;
int a[maxx];
int main() {
    int T; cin >> T;
    while (T--) {
        int n, m, p;
        cin >> n >> m >> p;
        if (n < m) 
            cout << 0 << endl;
        else 
            cout << (n - m) / (m - ((100 - p) * m / 100)) + 1 << endl;
    }
}