def sieve(n):
    is_prime = [True for _ in range(n)]
    is_prime[0] = False

    for i in range(2, n+1):
        if is_prime[i-1]:
            j = 2 * i
            while j <= n:
                is_prime[j-1] = False
                j += i
    table = [ i for i in range(1, n+1) if is_prime[i-1]]
    return table

T=int(input())
for i in range(T):
    N,P,Q=map(int,input().split())
    ans=P*len(sieve(N))/((P*len(sieve(N)))+(N-len(sieve(N)))*(100-Q))
    print(ans)