In the first test case, we have $$N = 4, A = [4, 2, 3, 1], Q = 3$$. Let's look at the queries:

$$\text{2 1 2 1}$$ :
- Consider numbers in range $$[1, 2]$$, they are $$\{4, 2\}$$.
- All non empty subsets of these numbers are $$\{4\}, \{2\}, \{4, 2\}$$.
- Bitwise XOR of all these subsets(individually) are $$4, 2, 6$$. Therefore, $$S = \{4, 2, 6\}$$.
- We have $$K = 1$$. All non-empty subsets of $$S$$ of size atmost $$K = 1$$ are $$\{4\}, \{2\}, \{6\}$$ and their sum is $$4 + 2 + 6 = 12$$.
$$\text{1 2 3 5}$$ : Array $$A$$ becomes $$[4, 5, 5, 1]$$.
$$\text{2 1 2 2}$$ :
- Consider numbers in range $$[1, 2]$$, they are $$\{4, 5\}$$.
- All non empty subsets of these numbers are $$\{4\}, \{5\}, \{4, 5\}$$.
- Bitwise XOR of all these subsets(individually) are $$4, 5, 1$$. Therefore, $$S = \{4, 5, 1\}$$.
- We have $$K = 2$$. All non-empty subsets of $$S$$ of size atmost $$K = 2$$ are $$\{4\}, \{5\}, \{1\}, \{4, 5\}, \{4, 1\}, \{5, 1\}$$ and their sum is $$4 + 5 + 1 + 9 + 5 + 6 = 30$$.
Note that we output answers in a single line.

In the second test case, we have $$N = 3, A = [2, 1, 1], Q = 1$$. Let's look at the queries:

$$\text{2 1 3 2}$$ :
- Consider numbers in range $$[1, 3]$$, they are $$\{2, 1, 1\}$$.
- All non empty subsets of these numbers are $$\{2\}, \{1\}, \{1\}, \{2, 1\}, \{2, 1\}, \{1, 1\}, \{2, 1, 1\}$$. Note that if there are same numbers we count them multiple times.
- Bitwise XOR of all these subsets(individually) are $$2, 1, 1, 3, 3, 0, 2$$. Therefore, $$S = \{2, 1, 3\}$$. Remember that in S, we need to insert only distinct values and remove the element 0.
- We have $$K = 2$$. All non-empty subsets of $$S$$ of size atmost $$K = 2$$ are $$\{2\}, \{1\}, \{3\}, \{2, 1\}, \{1, 3\}, \{2, 3\}$$ and their sum is $$2 + 1 + 3 + 3 + 4 + 5 = 18$$.
Note that we output answers in a single line.