Description

Libra wrote down an array of non-negative integers $a_1,a_2,\dots, a_n$. For each continuous subsequence $\{a_l,a_{l+1},\dots,a_r\}$ of the array, Libra can calucate its bitwise-xor sum: $a_l\;\mathrm{xor}\;a_{l+1}\;\mathrm{xor}\;\dots \;\mathrm{xor}\; a_r$. (xor represents ^ in C/C++)

Libra gives you $m$ queries, each of which is described by an integer $x_i$. For each query, you need to find a continuous subsequence with minimum value of $|x_i-R|$, where $R$ is the bitwise-xor sum of the subsequence. You should tell Libra the length of the corresponding sequence.

If there are multiple subsequences that meet the conditions, tell Libra the longest length of these subsequences.

Format

Input

The first line contains one integer $T(1\le T\le 100)$ --- the number of test cases.

Each test case consists of two lines.

The first line contains $N+1$ non-negative integers. The first number is $N(1\le N\le 100)$ --- the length of the array. The next $N$ numbers describe the array $\{a_i\}$ Libra wrote down.$(a_i\le 1024)$

The first line contains $M+1$ integers. The first number is $M(1\le M\le 100)$ --- the number of queries. The next $M$ numbers $x_i(|x_i|\le 1024)$ describe the queries.

Output

For each test case, print $M+1$ lines. The first $M$ lines contains the answer to the $M$ queries, and the $(M+1)$-th line left empty.

Samples

2
2 1 1
2 0 2
3 1 2 4
3 10 5 1

2
1

3
2
1