You are given an array \(A\) of length \(N\). You can perform the following operation at most once.

• Choose any element of the array and replace it with \(X\) where \(1 \leq X \leq M\).

Find the maximum possible GCD of the array after performing the operation.

Input Format:

• The first line contains an integer \(T\), which denotes the number of test cases. 
• The first line of each test case contains two integers \(N\) and \(M\).
• The second line of each test case contains \(N\) space-separated integers, elements of array \(A\).

Output Format:

For each test case, print the maximum possible GCD of the array after performing the operation at most once.

Constraints:

\(1 \leq T \leq 10 \\ 1 \leq N,M \leq 10^5 \\ 1 \leq A[i] \leq 10^5\)