3106：Flip and Turn

Let us define a set of operations on a rectangular matrix of printable characters.

A matrix A with m rows (1-st index) and n columns (2-nd index) is given. The resulting matrix B is defined as follows.

• Transposition by the main diagonal (operation identifier is ‘1’): B_j,i = A_i,j
• Transposition by the second diagonal (‘2’): B_{n−j+1,m−i+1} = A_i,j
• Horizontal flip (‘H’): B_m−i+1,j = A_i,j
• Vertical flip (‘V’): B_i,n−j+1 = A_i,j
• Rotation by 90 (‘A’), 180 (‘B’), or 270 (‘C’) degrees clockwise; 90 degrees case: B_j,m−i+1 = A_i,j
• Rotation by 90 (‘X’), 180 (‘Y’), or 270 (‘Z’) degrees counterclockwise; 90 degrees case: B_n−j+1,i = A_i,j

You are given a sequence of no more than 100 000 operations from the set. Apply the operations to the given matrix and output the resulting matrix.

At the first line of the input file there are two integer numbers — m and n (0 < m, n ≤ 300). Then there are m lines with n printable characters per line (we define a printable character as a symbol with ASCII code from 33 to 126 inclusive). There will be no additional symbols at these lines.

The next line contains the sequence operations to be performed, specified by their one-character identifiers. The operations should be performed from left to right.