//#pragma comment(linker, "/STACK:102400000,102400000")
/**Header!**/ //{
#include <cstdio>
#include <cmath>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <stack>
#include <queue>
using namespace std;

#define MZ(array) memset(array, 0, sizeof(array))
#define MF1(array) memset(array, -1, sizeof(array))
#define MINF(array) memset(array, 0x3f, sizeof(array))
#define REP(i, n) for (i = 0; i < (n); i++)
#define FOR(i, x, n) for (i = (x); i <= (n); i++)
#define ROF(i, x, y) for (i = (x); i >= (y); i--)
#define RD(x) scanf("%d", &x)
#define RD2(x, y) scanf("%d%d", &x, &y)
#define RD3(x, y, z) scanf("%d%d%d", &x, &y, &z)
#define RD4(x, y, z, w) scanf("%d%d%d%d", &x, &y, &z, &w)
#define WN(x) printf("%d\n", x);
#define RE freopen("D.in", "r", stdin)
#define WE freopen("huzhi.txt", "w", stdout)
#define MP make_pair
#define PB push_back
#define PF push_front
#define PPF pop_front
#define PPB pop_back
#define lowbit(x) ((x) & (-x))
#define cindiao ios_base::sync_with_stdio(0)
#define fcout(x, y) cout << fixed << setprecision(x) << (y) << endl
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
template <class T>
inline void OA(const T &a, const int &st, const int &ed)
{
    if (ed >= st)
        cout << (a[st]);
    int i;
    FOR(i, st + 1, ed)
        cout << ' ' << (a[i]);
    puts("");
}
inline void RDQ(int &x)
{
    char c;
    while (!isdigit(c = getchar()))
        ;
    x = c - '0';
    while (isdigit(c = getchar()))
        x = x * 10 + c - '0';
}
inline void WIQ(const int &x)
{
    if (x >= 10)
        WIQ(x / 10);
    putchar(x % 10 + '0');
}

template <class T>
inline T quickPow(T p, T e, const T &M)
{
    LL ret = 1;
    for (; e > 0; e >>= 1)
    {
        if (e & 1)
            ret = (ret * p) % M;
        p = (p * p) % M;
    }
    return (T)ret;
}
template <class T>
inline T gcd(const T &a, const T &b)
{
    return (b == 0) ? a : gcd(b, a % b);
}
template <class T>
inline T niyuan(const T &a, const T &M)
{
    return quickPow(a, M - 2, M);
}
template <class T>
inline T exgcd(const T &a, const T &b, T &x, T &y)
{
    if (!b)
    {
        x = 1, y = 0;
        return a;
    }
    T ret = exgcd(b, a % b, x, y), t;
    t = x, x = y, y = t - a / b * y;
    return ret;
}
template <class T>
inline T niyuanex(const T &a, const T &M)
{
    T x, y;
    exgcd(a, M, x, y);
    return (x + M) % M;
}
inline LL calC(const int &n, int m, const LL &MOD)
{
    m = (n - m > m) ? m : (n - m);
    LL up = 1, down = 1;
    int i;
    for (i = 1; i <= m; i++)
    {
        down *= i;
        down %= MOD;
        up *= (n - i + 1);
        up %= MOD;
    }
    return (up * niyuanex(down, MOD)) % MOD;
}
inline LL Lucas(const int &n, const int &m, const int &MOD)
{
    if (m == 0)
        return 1;
    return (1LL * Lucas(n / MOD, m / MOD, MOD) * calC(n % MOD, m % MOD, MOD)) % MOD;
}
const int gx[4] = {-1, 0, 1, 0};
const int gy[4] = {0, 1, 0, -1};
const double PI = acos(-1.0);
//}
const double EPS = 1e-10;
inline int sgn(double &x)
{
    if (fabs(x) < EPS)
        return 0;
    if (x < 0)
        return -1;
    else
        return 1;
}
const int INF = 0x3f3f3f3f;
const int NINF = 0x80000001;
const int MAXN = 1003;
const int MAXM = 100011;
const int MOD = 1 << 30;

int a[MAXN][MAXN];
int T, n, m, p;
inline int farm()
{
    int q = ceil(m*p/100.0);
    // int times = (n-m)/q;
    // int last = n - q*times;
    int last = n;
    int times = 0;
    while(last>=m){
        last -= q;
        times++;
    }
    return times;
}

inline void init()
{
}

int main()
{
    int t, i, j;
    // printf("??");
    // init();
    // printf("!?");
    scanf("%d", &T);
    REP(t, T){
        scanf("%d%d%d", &n, &m, &p);
        cout<<farm()<<endl;
    }
        // puts("");
    return 0;
}