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: Treat it as a floating-point number and round to six decimal places. If there are fewer than six decimal places, append '0' until reaching six decimal places.
• 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 |x| > |y|: x is listed before y
  • If |x| = |y|: follows the lexicographical order

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

• Testcases 1 ~ 2: 1 ≤ T ≤ 1000, 1 ≤ |S | ≤ 10⁴, only "+" operation, a and b are guaranteed to consist of lowercase letters
• Testcases 3 ~ 4: 1 ≤ T ≤ 1000, 1 ≤ |S | ≤ 10⁴, "+, -" operations, a and b are guaranteed to consist of lowercase letters
• Testcases 5 ~ 6: 1 ≤ T ≤ 1000, 1 ≤ |S | ≤ 10⁴, "+, -, ." operations, a and b are guaranteed to consist of lowercase letters and digits
• Testcases 7 ~ 8: 1 ≤ T ≤ 1000, 1 ≤ |S | ≤ 5*10⁴, 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