Lets define three functions:
$F(P,Q)=$ $(\overline{P\&Q}) \&(\overline{P}|Q)$  
$G(A,B,C)$$= (B\&F(A,C))|(A\&F(B,C))$
$H(A,B)= max( G(A,B,C) )$ , (maximum possible value of $G(A,B,C)$, where C can be any whole number).

Here, $\&$ represents bitwise "and", $|$ represents bitwise "or", and $\overline{A}$ ,represents bitwise "not" of $A$.

Suppose, we are given an array a of size n, with elements a₁, a₂, a₃, …a_n.
We define sadness of this array as:
$H(….(H(H(H(a1,a2),a3),….),an-1),an).$

You are given an array ‘A’ of size ‘N’, and a number ‘K’ , Your task is to find the number of subsequence whose sadness is greater than or equal to K. (Sadness of empty set would be 0, and sadness of singleton set would be the only element itself).

A sequence "a" is a subsequence of an array "b" if "a" can be obtained from "b" by deleting some (possibly, zero or all) elements.

Input:

- First line of input contains ‘T’, the number of test case.
- First line of each test case contains two integer, ‘N’ and ‘K’, denoting the size of array, and the number ‘K’.
- Second line of each test case contains N space separated integers, A₁, A₂, A₃, …A_N, the elements of the array.

Output:

For each test case, print a single line containing one integer – the answer to each test case (modulo 10⁹ + 7, as answer could be very large).

Constraints:

1<=T<=10
1<=N<=10⁵
0<=Ai<2³⁰
0<=K<2²⁰

40% of the input file has:

1<=T<=10
1<=N<=10000
0<=Ai<2¹⁰
0<=k<2¹⁰
Sum of N over all test case does not exceed 2*10⁴