B'You are given two arrays a and b of size n along with a fixed integer v . An interval [l, r] is called a good interval if (b_l mid b_{l+1} mid ldots mid b_r) ge v , where | denotes the bitwise OR operation. The beauty of a good interval is defined as max(a_l, a_{l+1}, ldots, a_r) . You are given q queries of two types: Please process all queries. Each test contains multiple test cases. The first line contains the number of test cases t ( 1 <= t <= 10^5 ). The description of the test cases follows. The first line of each test case contains two integers n and v ( 1 <= n <= 2 cdot 10^5 , 1 <= v <= 10^9 ). The second line of each testcase contains n integers a_1, a_2, ldots, a_n ( 1 <= a_i <= 10^9 ). The third line of each testcase contains n integers b_1, b_2, ldots, b_n ( 1 <= b_i <= 10^9 ). The fourth line of each testcase contains one integer q ( 1 <= q <= 2 cdot 10^5 ). The i -th of the following q lines contains the description of queries. Each line is of one of two types: It is guaranteed that both the sum of n and the sum of q over all test cases do not exceed 2 cdot 10^5 . For each test case, output the answers for all queries of the second type. In the first test case, a = [2, 1, 3] , b = [2, 2, 3] , and v = 7 . The first query is of the second type and has l = 1 and r = 3 . The largest interval available is [1, 3] , and its bitwise OR is b_1 mid b_2 mid b_3 = 3 which is less than v . Thus, no good interval exists. The second query asks to change b_2 to 5 , so b becomes [2, 5, 3] . The third query is of the second type and has l = 2 and r = 3 . There are three possible intervals: [2, 2] , [3, 3] , and [2, 3] . However, b_2 = 5 < v , b_3 = 3 < v . So only the last interval is go'...