Bloom Filter False Positive Rate

A Bloom filter has m bits and k hash functions and stores n items. Using the standard approximation (1 - e^(-kn/m))^k, print the false positive probability to 6 decimal places.

1 <= m, k, n <= 10^9