Unreasonable Updates

Given an array $A$ of length $N$, you have to perform $Q$ queries on it. There are three different type of queries: - $1$ $L$ $R$ - For every $i$ such that $L \le i \le R$ and $A_i \gt 0$, replace $A_i$ with $A_i$ $|$ $(A_i-1)$. - $2$ $L$ $R$ - For every $i$ such that $L \le i \le R$ and $A_i \gt 0$, replace $A_i$ with $A_i$ $\&$ $(A_i-1)$. - $3$ $x$ - Print $A_x$. Output the answer to each qu