write a go solution for Description:
Let us call an array x_1,...,x_m interesting if it is possible to divide the array into k>1 parts so that bitwise XOR of values from each part are equal.

More formally, you must split array x into k consecutive segments, each element of x must belong to exactly 1 segment. Let y_1,...,y_k be the XOR of elements from each part respectively. Then y_1=y_2=...=y_k must be fulfilled.

For example, if x=[1,1,2,3,0], you can split it as follows: [colorblue1],[colorgreen1],[colorred2,colorred3,colorred0]. Indeed colorblue1=colorgreen1=colorred2opluscolorred3opluscolorred0.

You are given an array a_1,...,a_n. Your task is to answer q queries:

- For fixed l, r, determine whether the subarray a_l,a_l+1,...,a_r is interesting.

Input Format:
The first line contains a single integer t (1<=t<=10^4) — the number of test cases.

The first line of each test case contains two integers n and q (2<=n<=2*10^5, 1<=q<=2*10^5) — the number of elements in the array and the number of queries respectively.

The next line contains n integers a_1,...,a_n (0<=a_i<2^30) — elements of the array.

Each of the next q lines contains two integers l and r (1<=l<r<=n) describing the query.

It is guaranteed that the sum of n over all testcases does not exceed 2*10^5.

It is guaranteed that the sum of q over all testcases does not exceed 2*10^5.

Output Format:
For each query, output "YES" if the subarray is interesting and "NO" otherwise.

You can output "Yes" and "No" in any case (for example, the strings "yES", "yes", and "Yes" will be recognized as correct answers).

Note:
Explanation for the first test case:

The first query is described in the statement.

In the second query, we should divide [1,2,3]. A possible division is [1,2],[3], since 1oplus2=3.

It can be shown that for queries 3,4,5, the subarrays are not interesting.. Output only the code with no comments, explanation, or additional text.