write a go solution for G. Shorten the Arraytime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputThe beauty of an array b of length m is defined as max(b_ioplusb_j) among all possible pairs 1<=i<=j<=m, where xoplusy is the bitwise XOR of numbers x and y. We denote the beauty value of the array b as f(b).An array b is called beautiful if f(b)>=k.Recently, Kostya bought an array a of length n from the store. He considers this array too long, so he plans to cut out some beautiful subarray from it. That is, he wants to choose numbers l and r (1<=l<=r<=n) such that the array a_l...r is beautiful. The length of such a subarray will be the number r-l+1. The entire array a is also considered a subarray (with l=1 and r=n).Your task is to find the length of the shortest beautiful subarray in the array a. If no subarray is beautiful, you should output the number -1.InputThe first line contains the number of test cases t (1<=t<=10^4).Next, there are t blocks of two lines:In the first line of the block, there are two integers n and k (1<=n<=2*10^5, 0<=k<=10^9).In the second line of the block, there is the array a consisting of n integers (0<=a_i<=10^9).It is guaranteed that the sum of n across all tests does not exceed 2*10^5.OutputFor each test case, you need to output a single integer — the minimum length of the segment (l,r) for which f(a_l...r)>=k. If such a segment is not found, you should output -1.ExampleInput65 01 2 3 4 55 71 2 3 4 55 81 2 3 4 55 73 5 1 4 25 33 5 1 4 26 7126 56 12 45 60 27Output1
2
-1
4
2
-1. Output only the code with no comments, explanation, or additional text.