#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9 + 10;
const ll INFL = 4e18;

int main() {
    int mx = 2e5;
    vector<int> is_prime(mx, 1);
    is_prime[1] = 0;
    for (int i = 2; i < mx; i++) {
        if (is_prime[i]) {
            for (int j = i * 2; j < mx; j += i) is_prime[j] = 0;
        }
    }
    vector<int> pref(mx + 1);
    for (int i = 0; i < mx; i++) pref[i + 1] = pref[i] + is_prime[i];

    int T;
    cin >> T;
    while (T--) {
        int N, P, Q;
        cin >> N >> P >> Q;

        int prime = pref[N + 1] - pref[1];
        int comp = N - prime;

        double lower = 0.01 * P * prime + 0.01 * (100 - Q) * comp;
        double upper = 0.01 * P * prime;

        printf("%.10lf\n", upper / lower);
    }
}