Prefix Suffix And Or

JJ has an integer $K$. JJ also has an array $A$ of length $N$ where $(0 \le A_i \lt 2^K)$. He can perform the following operations on $A$ any number of times (possibly zero): - Select $i$ and $x$ such that $1 \le i \le N$ and $0 \le x \lt 2^K$ and for each $1 \le j \le i$, set $A_j := A_j \And x$. - Select $i$ and $x$ such that $1 \le i \le N$ and $0 \le x \lt 2^K$ and for each $i \le j \le N$, se