#include <cstdio>
#include <iostream>
#include <cstring>
#include <queue>
#include <cmath>
#include <set>
#include <algorithm>
#include <map>
#include <vector>
#define mod 1000000007
using namespace std;
typedef long long ll;

const int N = 106;
const int inf = 0x3f3f3f3f;

int main()
{
    int t, n, m, p;
    scanf("%d", &t);
    while(t--){
        scanf("%d%d%d", &n, &m, &p);
        double d = (double)(100-p)/100.0;
        int ans = 0;
        while(n >= m){
            n -= m-m*d;
            ++ans;
        }
        printf("%d\n", ans);
    }
    return 0;
}