Migrated from Lutece 666 Krolia's Number

All parts of this problem, including description, images, samples, data and checker, might be broken. If you find bugs in this problem, please contact the admins.

Description

Krolia define a new number which is called Kumber. To get a Kumber, one must do a Kumber Transformation on a positive integer which don't contains the digit $0$.

A Kumber Transformation is that delete a digit $i$($1\leq i\leq 9$) in the integer $a_i$ times. For example, $a_i=(1,1,1,0,0,0,0,0,0)$ and the integer $n=123321$, which means you must delete one digit $1$,one digit $2$ and one digit $3$ from $n$.After the Kumber Transformation you will get some Kumbers such as $123,321,231\cdots$

Given $a_i$ and the positive integer $n$, you must find the largest Kumber which one can get from that Kumber Transformation.

Input

There is only one integer $T$($T\leq 100$) in the first line indicating the number of test cases.

The first line of each test cases contains an integer $n$($0\leq n<10^{101}$,No $0$-digit in number $n$), and the second line contains $9$ numbers $a_i$ ($0\leq a_i\leq 100$).We guarantee that the integer $n$ contains at least $a_i$ digit $i$ and the sum of $a_i$ is less than the length of n(that is to say, you won't get nothing after the transformation).

Output

For each test case, output an integer which is the largest Kumber you can get.

Samples

2
123321
1 1 1 0 0 0 0 0 0
212
0 1 0 0 0 0 0 0 0

321
21

Resources

KroliaFansClub