Bad XOR | BADXOR

Time Limit: 1s

You are given an array A of N elements. Also you are given another array B of M elements. Any subset (i­₁, i₂, i₃, …., i_p ) is bad IFF ( Ai₁ ⊕ Ai₂ ⊕ …. ⊕ Ai_p ) equals any value of B. ⊕ means Bitwise XOR, which can be found with ^ syntax in popular programming languages. Now your job is to find the number of good subsets. Empty Subset has XOR value of 0.

Input

The first line of input denotes the number of test cases T (1 <= T <= 20). The first line of each test case contains two integers N and M ( 0 <= N, M <= 1000). The next line contains N integers of the array A (0 <= A_i <=1000). The next line contains M integers of the array B (0 <= B_i <=1000). You can assume that each element of array B will be unique.  

Output

For each case, print the case number and the total numbers of good subsets in a line. As the result can be very big, output it modulo 100000007.

 Problem Setter: Nafis Sadique

Special Thanks: Ahmad Faiyaz