Beautiful Subarrays

- 给定长度为 $n$ 的序列 $a$。 - 序列 $a$ 的一个子段是这样一个序列：$a_l,a_{l+1},\cdots,a_r$，其中 $1\le l\le r\le n$。 - 给定 $k$。求有多少个 $a$ 的子段 $a_l,a_{l+1},\cdots,a_r$，满足 $$\bigoplus_{i=l}^r a_i\ge k$$ - $1\le n\le 10^6$，$1\le a_i,k\le 10^9$。

One day, ZS the Coder wrote down an array of integers $ a $ with elements $ a_{1},a_{2},...,a_{n} $ . A subarray of the array $ a $ is a sequence $ a_{l},a_{l+1},...,a_{r} $ for some integers $ (l,r) $ such that $ 1<=l<=r<=n $ . ZS the Coder thinks that a subarray of $ a $ is beautiful if the bitwise xor of all the elements in the subarray is at least $ k $ . Help ZS the Coder find the number of beautiful subarrays of $ a $ !

The first line contains two integers $ n $ and $ k $ ( $ 1<=n<=10^{6},1<=k<=10^{9} $ ) — the number of elements in the array $ a $ and the value of the parameter $ k $ . The second line contains $ n $ integers $ a_{i} $ ( $ 0<=a_{i}<=10^{9} $ ) — the elements of the array $ a $ .

Print the only integer $ c $ — the number of beautiful subarrays of the array $ a $ .

3 1
1 2 3

5

3 2
1 2 3

3

3 3
1 2 3

2