You are given an integer (k) and (n) positive integers (a_1, a_2, \ldots, a_n) written on a whiteboard, where (1\le a_i\le \boldsymbol{n}). You may perform the following operations: Erase : Choose an integer from the whiteboard and erase it. This operation can be performed at most (k) times. Split : Choose an integer (x\ge 3) from the whiteboard. Split it into three positive integers (x_1), (x_2), and (x_3) such that (x_1 + x_2 + x_3 = x), and (1\le x_1\le x_2\le x_3). Then, erase (x) from the whiteboard and write two new integers (x_1) and (x_3) on the whiteboard. Note that (x_2) is discarded and not written on the whiteboard. This operation may be performed any number of times. The beauty of a collection of integers (b) is defined as the greatest common divisor of all the elements in (b). Formally, it is the largest integer (d) such that (d) divides (x) for every (x) that is an element of (b). Your task is to determine the maximum possible beauty of the integers on the whiteboard after performing at most (k) Erase operations and any number of Split operations. 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 (k) ((1\le n \le 2 \cdot 10^5), (0 \le k \le n - 1)) — the number of integers on the whiteboard, and the maximum number of Erase operations allowed. The second line of each test case contains (n) integers (a_1, a_2, \ldots, a_n) ((1 \le a_i \le \boldsymbol{n})) — the integers initially written on the whiteboard. It is guaranteed that the sum of (n) over all test cases does not exceed (2 \cdot 10^5). For each test case, output a single integer representing the maximum beauty of the elements written on the whiteboard after performing the operations.