For a sequence (b) consisting of (m) integers, the set (S(b)) is defined as the set of tuples ((i,j,k)) that satisfy the following conditions: (i), (j), (k) are integers; (1 \le k \lt m); (1 \le i \lt j \le m-k+1); For every element (v) in (b), (v) appears the same number of times in (b_i,b_{i+1},\ldots,b_{i+k-1}) and (b_j,b_{j+1},\ldots,b_{j+k-1}). For example, when (b=1,2,1,2), the tuple ((1,3,2)) is an element of (S(b)) because (1) and (2) both appear once in (b_1,b_2) and (b_3,b_4). Additionally, we define two functions over sequences of positive integers: (k_\max(b)) is defined as the maximum value of (k) over all elements ((i,j,k)) of (S(b)); (f(b)) is defined as the number of different elements ((i,j,k)) of (S(b)) such that (k=k_\max(b)). Exceptionally , when the set (S(b)) is empty , they are defined as (k_\max(b)=0) and (f(b)=0). You are given a sequence (a) of (n) integers. Please answer (q) queries of the following kind: (i\;x): Change the value of (a_i) to (x). Then, find the values of (k_\max(a)) and (f(a)). Do note that the updates are persistent. In other words, the update from one query affects the later queries as well. 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) ((2 \le n \le 200\,000), (1 \le q \le 100\,000)). The second line of each test case contains (n) integers (a_1,a_2,\ldots,a_n) ((1 \le a_i \le n)). Each of the following (q) lines contains two integers (i_j) and (x_j) denoting the (j)-th query ((1 \le i_j,x_j \le n)). It is guaranteed that the sum of (n) over all test cases does not exceed (200\,000). It is guaranteed that