namespace AtCoder;

#nullable enable

using System.Numerics;

class Prime
{
    readonly int[] sieve;
    public readonly List<int> Primes = new();

    public Prime(int n)
    {
        if (n <= 3) n = 3;
        sieve = new int[n + 1];
        var (d, i, primes) = (2, 5, Primes);
        primes.Add(2);
        primes.Add(3);
        var span = sieve.AsSpan();
        span[1] = 1;
        for (var j = 2; j <= n; j += 2) span[j] = 2;
        for (var j = 3; j <= n; j += 3) span[j] = 3;
        while (i <= n)
        {
            if (span[i] == 0)
            {
                primes.Add(i);
                for (var j = i; j <= n; j += i) span[j] = i;
            }
            i += d;
            d ^= 6;
        }
    }

    public bool IsPrime(int x)
    {
        if (x < 2) return false;
        if (x < sieve.Length) return sieve[x] == x;
        foreach (long p in Primes)
        {
            if (p * p > x) return true;
            if (x % p == 0) return false;
        }
        throw new Exception();
    }

    // descending
    public List<int> Factorize(int x)
    {
        var factors = new List<int>();
        while (sieve[x] > 1) { factors.Add(sieve[x]); x /= sieve[x]; }
        return factors;
    }

    public List<int> Divisors(int x)
    {
        var factors = Factorize(x);
        var powerLists = new List<List<int>>();
        var last = 1;
        foreach (var factor in factors)
        {
            if (factor != last)
            {
                powerLists.Add(new List<int>(new int[] { 1 }));
                last = factor;
            }
            var powers = powerLists[^1];
            powers.Add(powers[^1] * factor);
        }
        var divisors = new List<int>();
        void Enumerate(int index, int divisor)
        {
            if (index == powerLists.Count) { divisors.Add(divisor); return; }
            foreach (var power in powerLists[index]) Enumerate(index + 1, divisor * power);
        }
        Enumerate(0, 1);
        return divisors;
    }
}

static class Extensions
{
    public static T[] Repeat<T>(this int time, Func<T> F) => Enumerable.Range(0, time).Select(_ => F()).ToArray();
}

class AtCoder
{
    object? Solve()
    {
        var max = 100000;
        var prime = new Prime(max);
        var cz = new int[max + 1];
        for (var i = 1; i <= max; i++)
        {
            cz[i] = cz[i - 1];
            if (prime.IsPrime(i)) cz[i]++;
        }
        var t = Int();
        var ans = new double[t];
        for (var i = 0; i < t; i++)
        {
            var n = Int();
            var p = Int();
            var q = Int();
            var c = cz[n];
            var yp = c * p * 0.01 / n;
            var np = (n - c) * (100 - q) * 0.01 / n;
            ans[i] = yp / (yp + np);
        }
        Out(ans);
        return null;
    }

    public static void Main() => new AtCoder().Run();
    public void Run()
    {
        var res = Solve();
        if (res != null)
        {
            if (res is bool yes) res = yes ? "Yes" : "No";
            sw.WriteLine(res);
        }
        sw.Flush();
    }

    string[] input = Array.Empty<string>();
    int iter = 0;
    readonly StreamWriter sw = new(Console.OpenStandardOutput()) { AutoFlush = false };

    string String()
    {
        while (iter >= input.Length) (input, iter) = (Console.ReadLine()!.Split(' '), 0);
        return input[iter++];
    }
    T Input<T>() where T : IParsable<T> => T.Parse(String(), null);
    int Int() => Input<int>();
    void Out(object? x, string? separator = null)
    {
        separator ??= Environment.NewLine;
        if (x is System.Collections.IEnumerable obj and not string)
        {
            var firstLine = true;
            foreach (var item in obj)
            {
                if (!firstLine) sw.Write(separator);
                firstLine = false;
                sw.Write(item);
            }
        }
        else sw.Write(x);
        sw.WriteLine();
    }
}