Playing with OR

You are given an array $A$ containing $N$ integers, and an integer $K$ ($1 \leq K \leq N$). Find the number of *subarrays* of $A$ with length $K$ whose [bitwise OR](https://en.wikipedia.org/wiki/Bitwise_operation#OR) is odd. **Note:** A subarray of $A$ is a contiguous segment of elements of $A$. For example, if $A = [1, 3, 2]$, then it has $6$ non-empty subarrays: $[1], [3], [2], [1, 3], [3,