Given a string S contains only A and B.
Calculate the Kth string T which doesn't appear in S.
Compare the string in order of length,if length is same,then sort in order of lexicographical order.
First line contains a single integer cases(cases≤5) which denotes the number of test cases.
For each test case, the first line is string S(1≤|S|≤20000), the second line have T+1 numbers,the first number is T,next T number(s) is Kth. (1≤T≤10,1≤K≤109)
For each case, output T lines.