/**********************************************
 *Author*        :jxf378440404
 *Created Time*  : 2020/7/25 14:32:40

*********************************************/

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <map>
#include <queue>
#include <set>
#define fi first
#define se second
#define ls now << 1
#define rs now << 1 | 1
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int MaxN = 1e5;
const int Inf = 1 << 30;
const LL mod = 998244353;
inline int lowbit(int x) { return x & -x; }

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