import bisect
def prime(x):
	pr = [True if i%2 == 1 else False for i in range(x+1)]
	pr[0] = False
	pr[1] = False
	pr[2] = True
	for i in range(3,x+1,2):
		if pr[i]:
			for j in range(i*i,x+1,i):
				pr[j] = False
	return [i for i in range(1,x+1) if pr[i]]

P = prime(10**5)
t = int(input())
for _ in range(t):
	n,p,q = map(int,input().split())
	ni = bisect.bisect(P,n)
	print((ni*p)/(ni*p+(n-ni)*(100-q)))