/**
	author:  shobonvip
	created: 2024.11.29 22:27:48
**/

#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int prime_number[100050];

void solve() {
	ll n, p, q;
	cin >> n >> p >> q;
	ll number_of_primes = prime_number[n];
	ll number_of_non_primes = n - prime_number[n];
	ll prob_of_yes_to_prime = number_of_primes * p;
	ll prob_of_yes_to_non_prime = number_of_non_primes * (100 - q);
	cout << setprecision(15);
	cout << double(prob_of_yes_to_prime) / double(prob_of_yes_to_prime + prob_of_yes_to_non_prime) << '\n';


}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	vector<bool> p(100050);
	rep(i,2,100050){
		if (p[i]) continue;
		prime_number[i] += 1;
		for (int j=i*2; j<100050; j+=i){
			p[j] = 1;
		}
	}
	rep(i,1,100050){
		prime_number[i] += prime_number[i-1];
	}
	
	int t; cin >> t;
	while(t--) solve();
}