import io
import sys
from collections import defaultdict, deque, Counter
from itertools import permutations, combinations, accumulate
from heapq import heappush, heappop
from bisect import bisect_right, bisect_left
from math import gcd
import math

_INPUT = """\
6
1
1 90 80
1
2 100 0
2
3 100 100
4 50 50
"""

def Eratosthenes(n):
  prime=[]
  furui=list(range(2,n+1))
  while furui[0]<math.sqrt(n):
    prime.append(furui[0])
    furui=[i for i in furui if i%furui[0]!=0]
  return prime+furui
prime=Eratosthenes(10**5)
a=[0]*(10**5+1)
for p in prime:
  a[p]=1
b=list(accumulate(a))
c=[0 if i == 0 else b[i]/i for i in range(10**5+1)]

def input():
  return sys.stdin.readline()[:-1]

def solve(test):
  T=int(input())
  for _ in range(T):
    N, P, Q = map(int, input().split())
    print(c[N]*P/100/(c[N]*P/100+(1-c[N])*(1-Q/100)))

def random_input():
  from random import randint,shuffle
  N=randint(1,10)
  M=randint(1,N)
  A=list(range(1,M+1))+[randint(1,M) for _ in range(N-M)]
  shuffle(A)
  return (" ".join(map(str, [N,M]))+"\n"+" ".join(map(str, A))+"\n")*3

def simple_solve():
  return []

def main(test):
  if test==0:
    solve(0)
  elif test==1:
    sys.stdin = io.StringIO(_INPUT)
    case_no=int(input())
    for _ in range(case_no):
      solve(0)
  else:
    for i in range(1000):
      sys.stdin = io.StringIO(random_input())
      x=solve(1)
      y=simple_solve()
      if x!=y:
        print(i,x,y)
        print(*[line for line in sys.stdin],sep='')
        break

#0:提出用、1:与えられたテスト用、2:ストレステスト用
main(0)