SumXor

For an array $B$ of length $M$, we define two functions: - Let $f(B)$ denote its bitwise XOR. That is, $f(B) = B_1\oplus B_2\oplus\ldots\oplus B_M$, where $\oplus$ denotes the [bitwise XOR]((https://en.wikipedia.org/wiki/Bitwise_operation#XOR)) operation. - Let $g(B)$ denote the sum of bitwise XORs of all its subarrays. That is, $$ g(B) = \sum_{i=1}^M \sum_{j=i}^M f([B_i, B_{i+1}, \ldots, B_j