The Little Elephant from the Zoo of Lviv is going to the Birthday Party of  the Big Hippo tomorrow. Now he wants to prepare a gift for the Big Hippo.

He has N balloons, numbered from 1 to N. The i-th balloon has the color Ci and it costs Pi dollars. The gift for the Big Hippo will be any subset (chosen randomly, possibly empty) of the balloons such that the number of different colors in that subset is at least M.

Help Little Elephant to find the expected cost of the gift.

-----Input-----
The first line of the input contains a single integer T - the number of test cases. T test cases follow. The first line of each test case contains a pair of integers N and M. The next N lines contain N pairs of integers Ci and Pi, one pair per line.

-----Output-----
In T lines print T real numbers - the answers for the corresponding test cases. Your answer will considered correct if it has at most 10^-6 absolute or relative error.

-----Constraints-----
- 1 ≤ T ≤ 40
- 1 ≤ N,  Ci≤ 40
- 1 ≤ Pi ≤ 1000000
- 0 ≤ M ≤ K, where K is the number of different colors in the test case.

-----Example-----
Input:
2
2 2
1 4
2 7
2 1
1 4
2 7

Output:
11.000000000
7.333333333

Starter code:

Solutions:
# cook your dish here
for _ in range(int(input())):
    n,m = list(map(int,input().split()))
    colors = [0]*41; cost = [0]*41
    color = 0
    for i in range(n):
        cc,pp = list(map(int,input().split()))
        colors[cc] += 1
        cost[cc] += pp
    for i in colors:
        if i>0: color += 1
    dp2 = [[0]*41 for i in range(color+1)]
    dp2[0] = [1]*41
    for i in range(1,color+1):
        for j in range(1,41):
            dp2[i][j] = dp2[i][j-1]+dp2[i-1][j-1]*(2**colors[j]-1)
    dp1 = [[0]*41 for i in range(color+1)]
    for i in range(1,color+1):
        for j in range(1,41):
            dp1[i][j] = dp1[i][j-1]+dp1[i-1][j-1]*(2**colors[j]-1)+dp2[i-1][j-1]*cost[j]*(2**(colors[j]-1))
    num=den=0
    for i in range(m,color+1):
        num += dp1[i][40]
        den += dp2[i][40]
    print(num/den)