#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> PII;

const int MAXN = 1e6 + 10;
const int MM = 1e9 + 7;

void solve(int casi){
    int n, m, p;
    scanf("%d%d%d", &n, &m, &p);
    int u = m * (100 - p) / 100;
    u = m - u;
    int cnt = (n - m) / u;
    n = n - cnt * u;
    while (n >= m) {
        n -= u;
        cnt++;
    }
    printf("%d\n", max(0, cnt));
}

int main(){
    int T = 1;
    scanf("%d", &T);
    for (int i = 1; i <= T; i++)
        solve(i);
    return 0;
}