cho.sh
Notes
Loading...

Lottery

Time limit

2s

Memory limit

128 MB

Problem

Jimin chooses M distinct numbers from 1 through N. The lottery also chooses M distinct numbers from 1 through N.

Jimin wins if at least K numbers appear in both choices. Compute the probability that Jimin wins.

Input

The first line contains three integers N, M, and K, separated by spaces.

Output

Print the probability that Jimin wins. An absolute or relative error of at most 10^{-9} is accepted.

Constraints

  • 2 <= N <= 8
  • 1 <= M <= N-1
  • 1 <= K <= M