There are $n$ shops numbered with successive integers from $1$ to $n$ in Byteland. Every shop sells only one kind of goods, and the price of the $i$-th shop‘s goods is viv_iv?i??.

Every day, Byteasar will purchase some goods. He will buy at most one piece of goods from each shop. Of course, he can also choose to buy nothing. Back home, Byteasar will calculate the total amount of money he has costed that day and write it down on his account book.

However, due to Byteasar‘s poor math, he may calculate a wrong number. Byteasar would not mind if he wrote down a smaller number, because it seems that he hadn‘t used too much money.

Please write a program to help Byteasar judge whether each number is sure to be strictly larger than the actual value.

The first line of the input contains an integer $T$ $(1\le T\le 10)$, denoting the number of test cases.

In each test case, the first line of the input contains two integers $n,m$ $(1\le n,m\le 100000)$, denoting the number of shops and the number of records on Byteasar‘s account book.

The second line of the input contains $n$ integers v1,v2,...,vnv_1, v_2, ..., v_nv?1??,v?2??,...,v?n?? (1≤vi≤100000)(1\leq v_i\leq 100000)(1≤v?i??≤100000), denoting the price of the $i$-th shop‘s goods.

Each of the next $m$ lines contains an integer $q$ (0≤q≤1018)(0\leq q\leq 10^{18})(0≤q≤10?18??), denoting each number on Byteasar‘s account book.

For each test case, print a line with $m$ characters. If the $i$-th number is sure to be strictly larger than the actual value, then the $i$-th character should be ‘1‘. Otherwise, it should be ‘0‘.