You are given a simple task. Given a sequence `A[i]` with `N` numbers. You have to perform Q operations on the given sequence.

Here are the operations:

- A v l, add the value
`v`to element with index`l`.(1<=V<=1000) - R a l r, replace all the elements of sequence with index
`i`(`l`<=`i`<=`r`) with`a`(1<=`a`<=10^6) . - Q l r, print the number of elements with index
`i`(`l`<=`i`<=`r`) and`A[i]`is a prime number

Note that no number in sequence ever will exceed 10^7.

The first line is a signer integer `T` which is the number of test cases.

For each test case, The first line contains two numbers `N` and `Q` (1 <= `N, Q` <= 100000) - the number of elements in sequence and the number of queries.

The second line contains `N` numbers - the elements of the sequence.

In next `Q` lines, each line contains an operation to be performed on the sequence.

提交代码