#include //#include using namespace std; //using namespace atcoder; //using mint = modint1000000007; //const int mod = 1000000007; //using mint = modint998244353; //const int mod = 998244353; //const int INF = 1e9; //const long long LINF = 1e18; #define rep(i, n) for (int i = 0; i < (n); ++i) #define rep2(i,l,r)for(int i=(l);i<(r);++i) #define rrep(i, n) for (int i = (n) - 1; i >= 0; --i) #define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i) #define all(x) (x).begin(),(x).end() #define allR(x) (x).rbegin(),(x).rend() #define P pair template inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; } template inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; } std::vector sieveOfEratosthenes(long long n = 1000000) { std::vectorp(n + 1, true); std::vectorret; p[0] = false; p[1] = false; for (int i = 2; i <= n; ++i) { if (!p[i]) continue; ret.push_back(i); for (int j = 2 * i; j <= n; j += i) p[j] = false; } return ret; } //long long にしているのは p*pとかでこまらないように int main() { ios::sync_with_stdio(false); cin.tie(nullptr); const int LIM = 100000; auto ps = sieveOfEratosthenes(LIM); vectorcnt(LIM + 1); for (auto e : ps)cnt[e] = 1; rep(i, LIM)cnt[i + 1] += cnt[i]; int t; cin >> t; while (t--) { int n, p, q; cin >> n >> p >> q; double ansP = (double)cnt[n] * p; double ansQ = ansP + (double)(n - cnt[n])*(100 - q); double ans = ansP / ansQ; cout << fixed << setprecision(16) << ans << endl; } return 0; }