#include<map>
#include<set>
#include<queue>
#include<stack>
#include<cmath>
#include<cstdio>
#include<vector>
#include<string>
#include<cstring>
#include<ctype.h>
#include<iostream>
#include<algorithm>
using namespace std;
#define INF (1 << 30)
#define LINF (1LL << 60)
#define PI acos(-1.0)
#define mem(a, b) memset(a, b, sizeof(a))
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define eps 1e-8
#define debug puts("===============")
#define pb push_back
#define mkp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
#define POSIN(x,y) (0 <= (x) && (x) < r && 0 <= (y) && (y) < c)
typedef long long ll;
typedef unsigned long long ULL;
int main()
{
    int test;
    scanf("%d", &test);
    rep(i, 0, test) {
        int n,m,p;
        scanf("%d%d%d", &n,&m,&p);
        p = 100 - p;
        int z = m - floor(m * p / 100);
        int ans = 0;
        if (n>=m) ans = 1 + (n-m)/z;
        printf("%d\n", ans);
    }
}