Migrated from Lutece 825 A Bit Fun

All parts of this problem, including description, images, samples, data and checker, might be broken. If you find bugs in this problem, please contact the admins.

Description

There are $n$ numbers in a array, as $a_{0},a_{1}\cdots ,a_{n-1}$, and another number $m$. We define a function $f(i,j)=a_{i}|a_{i+1}|a_{i+2}|\cdots |a_{j}$. Where $|$ is the bit-OR operation. ($i\leq j$)

The problem is really simple: please count the number of different pairs of ($i,j$) where $f(i,j)<m$.

Input

The first line has a number $T$ ($T\leq 50$) , indicating the number of test cases.

For each test case, first line contains two numbers $n$ and $m$.($1\leq n\leq 100000, 1\leq m\leq 2^{30}$) Then $n$ numbers come in the second line which is the array a, where $1\leq a_{i}\leq 2^{30}$.

Output

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.

Samples

2
3 6
1 3 5
2 4
5 4

Case #1: 4
Case #2: 0

Resources

2013 ACM/ICPC Asia Regional Chengdu Online