B"Let's consider the following simple problem. You are given a string s of length n , consisting of lowercase Latin letters, as well as an array of indices ind of length m ( 1 <= q ind_i <= q n ) and a string c of length m , consisting of lowercase Latin letters. Then, in order, you perform the update operations, namely, during the i -th operation, you set s_{ind_i} = c_i . Note that you perform all m operations from the first to the last. Of course, if you change the order of indices in the array ind and/or the order of letters in the string c , you can get different results. Find the lexicographically smallest string s that can be obtained after m update operations, if you can rearrange the indices in the array ind and the letters in the string c as you like. A string a is lexicographically less than a string b if and only if one of the following conditions is met: Each test consists of several sets of input data. The first line contains a single integer t ( 1 <= q t <= q 10^4 ) -- the number of sets of input data. Then follows their description. The first line of each set of input data contains two integers n and m ( 1 <= q n, m <= q 10^5 ) -- the length of the string s and the number of updates. The second line of each set of input data contains a string s of length n , consisting of lowercase Latin letters. The third line of each set of input data contains m integers ind_1, ind_2, ldots, ind_m ( 1 <= q ind_i <= q n ) -- the array of indices ind . The fourth line of each set of input data contains a string c of length m , consisting of lowercase Latin letters. It is guaranteed that the sum of n over all sets of input data does not exceed 2 cdot 10^5 . Similarly, the sum of m over all sets of input data does not exceed 2 cdot 10^5 . For each set of inp"...