This is the easy version of the problem. The only difference between the versions is that in this version, (q = 0). Note that zero-based indexing is used in this problem. For an array (b) consisting of (m) positive integers, define (f(b)) as follows. For a non-negative integer (k), we say that (b) can be (k)-sorted if it can be sorted in non-decreasing order by performing the following operation any number of times: Choose two indices (i) and (j) ((0 \le i \lt j \le m - 1)) such that (i \oplus j \le k)(^{\text{∗}}). Note that the condition applies to the indices (i) and (j), not to the elements (b_i) and (b_j). Swap the elements (b_i) and (b_j). The value (f(b)) is defined as the smallest non-negative integer (k) such that the array (b) can be (k)-sorted. You are given an array (a) of length (n), consisting of positive integers. You will perform (q) updates on (a). Each update has the following form: (i \; x): assign (a_i = x). Note that the updates are persistent . In other words, each update affects all subsequent states of the array. For each of the (q + 1) states of (a) — the initial state and the state after each of the (q) updates — find the value of (f(a)). (^{\text{∗}})(\oplus) denotes the bitwise XOR operation Each test contains multiple test cases. The first line contains the number of test cases (t) ((1 \le t \le 10^4)). The description of the test cases follows. The first line of each test case contains two integers (n) and (q) ((1 \le n \le 10^6, q = 0)) — the length of the array (a) and the number of updates. The second line of each test case contains (n) integers (a_0, a_1, \ldots, a_{n - 1}) ((1 \le a_i \le 10^9)) — the array (a). The (j)-th of the following (q) lines contains two integers (i_j) and (x_j) ((0 \le i_j \lt n), $$$1 \le x_j \le 10^9$$