Least Prime Factor

$2$

Given an array a of N elements, you need to handle Q types of queries as follows:

$3$

$11$r: For each index i in the range l $<=$ i $<=$ r update the element a$\_\{$i$\}$ by dividing it by the smallest prime factor of a$\_\{$i$\}$

$21$: Compute and print the sum of a$\_\{$i$\}$ in the array from index l $<=$ i $<=$ r

$5$

$3$ ik: Update the element at index i to the value k$.$ i$.$e$.$ a$\_\{$i$\}=$ k

$6$

Function description

Complete the Divisor$\_$Queries function. This function takes the following $4$ parameters and returns the answer

$7$

$$ N: An Integer representing the length of array a

$8$

$$ Q$.$ An Integer representing the number of queries

$$ a$.$ An Array of length N representing array a

$$ Queries. A $2$D$-$Array of Q rows and $3$ columns representing the three types of Queries