Given an array of N elements , You need to find subarray of size Z , XOR of whose elements is minimum.If multiple such subarrays exist,Choose the subarray whose starting Index is Maximum. Print the start Index of that subarray.

Input Format:
First line of the input will have T (number of test cases). Then for each test case first line will have two integers N and Z. The second line will have a list of N space separated integers denoting the Array values (Array is denoted by A).

Output Format: For each test case, output a single integer denoting starting Index of Subarray.

Input Constraints:

\(1 \le T \le100 \)
\(1 \le Z \le N \le10^4\)
\(1 \le A_i \le10^{12} \)