write a go solution for J. Xorderable Arraytime limit per test1 secondmemory limit per test1024 megabytesinputstandard inputoutputstandard outputYou are given an array A of N integers: [A_1,A_2,...,A_N].The array A is (p,q)-xorderable if it is possible to rearrange A such that for each pair (i,j) that satisfies 1<=qi<j<=qN, the following conditions must be satisfied after the rearrangement: A_ioplusp<=A_joplusq and A_ioplusq<=A_joplusp. The operator oplus represents the bitwise xor.You are given another array X of length M: [X_1,X_2,...,X_M]. Calculate the number of pairs (u,v) where array A is (X_u,X_v)-xorderable for 1<=u<v<=M.InputThe first line consists of two integers N M (2<=N,M<=200,000).The second line consists of N integers A_i (0<=A_i<2^30).The third line consists of M integers X_u (0<=X_u<2^30).OutputOutput a single integer representing the number of pairs (u,v) where array A is (X_u,X_v)-xorderable for 1<=qu<v<=qM.ExamplesInput3 4
0 3 0
1 2 1 1
Output3
Input5 2
0 7 13 22 24
12 10
Output1
Input3 3
0 0 0
1 2 3
Output0
NoteExplanation for the sample input/output #1The array A is (1,1)-xorderable by rearranging the array A to [0,0,3].Explanation for the sample input/output #2The array A is (12,10)-xorderable by rearranging the array A to [13,0,7,24,22].. Output only the code with no comments, explanation, or additional text.