Contiguous Subsequence XOR

You are given a sequence $A_1, A_2, \dots, A_N$ of length $N$. Count the contiguous subsequences whose XOR is less than $K$.

A contiguous subsequence is $A_i, A_{i+1}, \dots, A_j$ for a pair of indices with $i \le j$. Its XOR is $A_i \oplus A_{i+1} \oplus \dots \oplus A_j$, where $\oplus$ is the bitwise exclusive or.

Two contiguous subsequences with a different start position or a different end position count separately, even when their elements have the same values.

The first line contains $N$ and $K$, separated by a space. ($1 \le N \le 100{,}000$, $1 \le K \le 1{,}000{,}000$)

The second line contains $A_1, A_2, \dots, A_N$ in order, separated by spaces. ($1 \le A_i \le 100{,}000$)

Print the number of contiguous subsequences whose XOR is less than $K$ on the first line.