B'Alperen has two strings, s and t which are both initially equal to "a". He will perform q operations of two types on the given strings: After each operation, determine if it is possible to rearrange the characters of s and t such that s is lexicographically smaller ^{ dagger} than t . Note that the strings change after performing each operation and don 't go back to their initial states. ^{ dagger} Simply speaking, the lexicographical order is the order in which words are listed in a dictionary. A formal definition is as follows: string p is lexicographically smaller than string q if there exists a position i such that p_i < q_i , and for all j < i , p_j = q_j . If no such i exists, then p is lexicographically smaller than q if the length of p is less than the length of q . For example, texttt{abdc} < texttt{abe} and texttt{abc} < texttt{abcd} , where we write p < q if p is lexicographically smaller than q . The first line of the input contains an integer t ( 1 <= q t <= q 10^4 ) -- the number of test cases. The first line of each test case contains an integer q (1 <= q q <= q 10^5) -- the number of operations Alperen will perform. Then q lines follow, each containing two positive integers d and k ( 1 <= q d <= q 2 ; 1 <= q k <= q 10^5 ) and a non-empty string x consisting of lowercase English letters -- the type of the operation, the number of times we will append string x and the string we need to append respectively. It is guaranteed that the sum of q over all test cases doesn 't exceed 10^5 and that the sum of lengths of all strings x in the input doesn 't exceed 5 cdot 10^5 . For each operation, output "YES", if it is possible to arrange the elements in both strings in such a way that s is lexicographically smaller '...