B'Given an array a_1, a_2, ... , a_n , you need to handle a total of q updates and queries of two types: The first line of the input contains an integer t ( 1 <= q t <= q 1000 ) -- the number of testcases. The first line of each test case contains two integers n and q ( 1 <= n, q <= 2 cdot 10^5 ) -- the size of the array and the number of queries, respectively. The second line of each test case contains n integers a_1, a_2, ... , a_n ( 1 <= a_i <= 10^9 ). The next q lines of each test case are of two forms: There is at least one query of the second type. The sum of n over all test cases does not exceed 2 cdot 10^5 . The sum of q over all test cases does not exceed 2 cdot 10^5 . For each test case, output the answers of queries of the second type, in the order they are given. In the first test case, the following process occurs: '...