Prime Query

You are given an array $A$ of length $N$. For the array $A$, a pair $(i, j) \: (1\le i\lt j \le N)$ is said to be *good* if both $(A_i + A_j)$ and $(A_i \cdot A_j)$ are [prime numbers](https://en.wikipedia.org/wiki/Prime_number). You are given $Q$ queries in the format: - $L$ $R$ $K$: Let $B$ denote the subarray $A[L, R]$. You are allowed to update **at most** $K$ elements of the array $B$ to a