Query Problem

Problem description. Given an array $A$ of length $N$ and $Q$ queries . There are two types of queries . Type $1$ query : $1$ $idx$ Type $2$ query ; $2$ $L$ $R$ For each query of type 1, you need to update value at $A[idx]$ to the largest divisor of $A[idx]$ which is smaller than $A[idx]$ . If $A[idx]$ is $1$ or a prime number then leave it as it is. For each query of type $2$ , you need to p