import sys
from functools import cache

sys.setrecursionlimit(10**6)


def solve():
    N, M, K = [int(s) for s in input().split()]

    remain = (N * M) - K

    # comb(m - 2, rem - 1) / comb(m - 1, rem)
    # n!*(r-1)!/r!(n-1)!
    P = remain / (M - 1) if remain < (M - 1) else 1.0

    @cache
    def dp(n):
        if (N - 1 - n) * M >= K:
            return 1.0

        if n == 0:
            return (1 / M) * P

        p = (M - 1) / (M * (n + 1)) * P
        p += n / (n + 1) * dp(n - 1)

        return p

    print(dp(N - 1))


if __name__ == "__main__":
    T = int(input())

    for _ in range(T):
        solve()