B'You are given two strings of equal length s_1 and s_2 , consisting of lowercase Latin letters, and an integer t . You need to answer q queries, numbered from 1 to q . The i -th query comes in the i -th second of time. Each query is one of three types: Note that in queries of the second type, the characters being swapped can be from the same string or from s_1 and s_2 . The first line of the input contains a single integer T ( 1 <= T <= 10^4 ) -- the number of test cases. Then follow the descriptions of the test cases. The first line of each test case contains a string s_1 consisting of lowercase Latin letters (length no more than 2 cdot 10^5 ). The second line of each test case contains a string s_2 consisting of lowercase Latin letters (length no more than 2 cdot 10^5 ). The strings have equal length. The third line of each test case contains two integers t and q ( 1 <= t, q <= 2 cdot 10^5 ). The number t indicates the number of seconds for which a character is blocked. The number q corresponds to the number of queries. Each of the next q lines of each test case contains a single query. Each query is one of three types: For queries of the first type, it is guaranteed that at the time of the query, the characters at position pos are not blocked. For queries of the second type, it is guaranteed that the characters being swapped are not blocked. All values of pos, pos_1, pos_2 are in the range from 1 to the length of the strings. The sum of the values of q over all test cases, as well as the total length of the strings s_1 , does not exceed 2 cdot 10^5 . For each query of the third type, output "YES" if the two strings s_1 and s_2 are equal at the time of the query, ignoring blocked characters, and "NO" otherwise. You can output each letter in any case (lowercase or uppercase). For e'...