Vlad and Dima have been assigned a task in school for their English class. They were given two strings (a) and (b) and asked to append all characters from (b) to string (a) in any order. The guys decided to divide the work between themselves and, after lengthy negotiations, determined who would add each character from string (b) to (a). Due to his peculiarities, Vlad can only add characters to the beginning of the word, while Dima can only add them to the end. They add characters in the order they appear in string (b). Your task is to determine what string Vlad and Dima will end up with. Each test consists of several test cases. The first line contains a single integer (t) ((1 \le t \le 1000)) — the number of test cases. The description of the test cases follows. The first line contains an integer (n) ((1 \le n \le 10)) — the length of the string (a). The second line contains the string (a), consisting of lowercase letters of the English alphabet. The third line contains an integer (m) ((1 \le m \le 10)) — the length of the strings (b) and (c). The fourth line contains the string (b), consisting of lowercase letters of the English alphabet. The fifth line contains the string (c), consisting of the characters 'V' and 'D' — the distribution of the characters of string (b) between Dima and Vlad. If (c_i) = 'V' , then the (i)-th letter is added by Vlad; otherwise, it is added by Dima. For each test case, output the string that will result from Dima and Vlad's work. In the first test case, there is initially a string (ot). Then Dima appends the character (a) to the end of the string, resulting in (ota), and Vlad appends the last character, resulting in (dota). In the second test case, the string will change as follows: $$$efo \rightarrow efor \rightarrow defor \rightarrow deforc \rightarrow odeforc \rightarrow odeforce \rightarrow codeforce \rightarrow codefo