Chocolate Wholesaler

No attempts yetTime limit1sMemory limit128 MB

Problem

A chocolate company is running a promotion: some chocolate bars hide a surprise inside, but you cannot tell from the outside whether a given bar contains one.

Fortunately, you can analyze each bar and determine the probability that it contains a surprise. Chocolates arrive at the wholesaler in cartons of nn bars, and you may only buy a whole carton, never a single bar.

Buying a carton pays off only if it contains at least kk surprises. Assuming the surprises occur independently across bars, compute the probability that a carton of nn chocolates contains at least kk surprises.

Input

The first line contains the number of test cases dd (1d100)(1 \le d \le 100).

For each test case, the first line contains two integers nn and kk (1n10000, 0kn)(1 \le n \le 10000,\ 0 \le k \le n). The second line contains nn real numbers giving the probability that each chocolate contains a surprise; every probability is given to four decimal places.

Output

For each test case, print on its own line the probability that a carton of nn chocolates contains at least kk surprises. Round the result to four decimal places.