Description

There are interesting string operations there.

• a + b: Concatenate the string b after the string a.
• a - b: If string b has appeared in string a, delete the first appearance of b in a, otherwise output "error".
• a [b]: Output the b-th character after sorting a in lexicographical order. If b exceeds the length of a, output "error".
• a @ b₁_b₂_b₃_...b_k: For all strings b_i concatenated with '_', if a has appeared in string b_i, add b_i to a list, output the list in this order:
  • If f_x > f_y: x is listed before y  (f_i is the number of occurrences of a in the string i )
  • ​If |x| > |y|: x is listed before y
  • If |x| = |y|: follows the lexicographical order
• a ? b₁_b₂_b₃_...b_k: You will receive the following T - 1 operations, output the result sorted according to the @ sorting rule in the end
  • 1 i p q: represents b_i = b_p + b_q
  • 2 i p q: represents b_i = b_p - b_q ​（If b_q cannot be found in b_p , ignore this operation.)

Input

The first line contains an integer T, representing the number of string operations.

The following T lines each contain a string S_i , representing the string operation in the i-th round.

​Subtasks​

• Testcase 1: 1 ≤ T ≤ 1000, 1 ≤ |S | ≤ 10⁴, only "+" operation, a and b are guaranteed to consist of lowercase letters
• Testcases 2 ~ 3: 1 ≤ T ≤ 1000, 1 ≤ |S | ≤ 10⁴, only "-" operation, a and b are guaranteed to consist of lowercase letters
• Testcases 4 ~ 5: 1 ≤ T ≤ 1000, 1 ≤ |S | ≤ 10⁵, only "[ ]" operation, a is guaranteed to consist of lowercase letters, and b is guaranteed to consist of digits
• Testcases 6: 1 ≤ T ≤ 1000, 1 ≤ |S | ≤ 10⁴, only "@" operation, a and b are guaranteed to consist of lowercase letters and "_"
• Testcases 7: 1 ≤ T ≤ 1000, 1 ≤ |S | ≤ 10⁵, only "@" operation, a and b are guaranteed to consist of lowercase letters and "_"
• Testcases 8: 1 ≤ T ≤ 10, 1 ≤ |S | ≤ 10⁴, 1 ≤ i, p, q ≤ k, only "?" operation, a and b are guaranteed to consist of lowercase letters and "_"
• Testcases 9: 1 ≤ T ≤ 1000, 1 ≤ |S | ≤ 10⁵, 1 ≤ i, p, q ≤ k, only "?" operation, a and b are guaranteed to consist of lowercase letters and "_"

Output

Output T lines, each containing a string S_i after operation.

 

Please remember to print "\n" at the end.

Sample Input  Download

Sample Output  Download

Tags

Discuss