#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;

int T;
int n, m, p;

int main() {
    cin >> T;
    while (T--) {
        scanf("%d%d%d", &n, &m, &p);

        double x = 1.0 * m * p * 0.01;
        int xx = 0;
        if (x - (double)((int)x) < 1e-3) {
            xx = x;
        } else {
            xx = x + 1;
        }

        int cnt = (n - 2 * m) / xx;
        if (cnt < 0) {
            cnt = 0;
        }
        n -= (cnt * xx);

        while (n >= m) {
            cnt++;
            n -= xx;
        }
        cout << cnt << endl;
    }
    return 0;
}