There are n numbers in a array, as a0, a1 ... , an-1, and another number m. We define a function f(i, j) = ai|ai+1|ai+2| ... | aj . Where "|" is the bit-OR operation. (i <= j) The problem is really simple: please count the number of different pairs of (i, j) where f(i, j) < m.
The first line has a number T (T <= 50), indicating the number of test cases.
For each test case, first line contains two numbers n and m.(1 <= n <= 1e5, 1 <= m <= 230) Then n numbers come in the second line which is the array a, where 1 <= ai <= 230.
For every case, you should output "Case #t: " at first, without quotes. The t is the case number starting from 1. Then follows the answer.