Matrix Operation

Time Limit : 2 sec, Memory Limit : 65536 KB

Matrix Operation

You are a student looking for a job. Today you had an employment examination for an IT company. They asked you to write an efficient program to perform several operations. First, they showed you an N \times N square matrix and a list of operations. All operations but one modify the matrix, and the last operation outputs the character in a specified cell. Please remember that you need to output the final matrix after you finish all the operations.

Followings are the detail of the operations:

WR r c v
(Write operation) write a integer v into the cell (r,c) (1 \leq v \leq 1,000,000)
CP r1 c1 r2 c2
(Copy operation) copy a character in the cell (r1,c2) into the cell (r2,c2)
SR r1 r2
(Swap Row operation) swap the r1-th row and r2-th row
SC c1 c2
(Swap Column operation) swap the c1-th column and c2-th column
(Rotate Left operation) rotate the whole matrix in counter-clockwise direction by 90 degrees
(Rotate Right operation) rotate the whole matrix in clockwise direction by 90 degrees
(Reflect Horizontal operation) reverse the order of the rows
(Reflect Vertical operation) reverse the order of the columns


First line of each testcase contains nine integers. First two integers in the line, N and Q, indicate the size of matrix and the number of queries, respectively (1 \leq N,Q \leq 40,000). Next three integers, A B, and C, are coefficients to calculate values in initial matrix (1 \leq A,B,C \leq 1,000,000), and they are used as follows: A_{r,c} = (r * A + c * B) mod C where r and c are row and column indices, respectively (1\leq r,c\leq N). Last four integers, D, E, F, and G, are coefficients to compute the final hash value mentioned in the next section (1 \leq D \leq E \leq N, 1 \leq F \leq G \leq N, E - D \leq 1,000, G - F \leq 1,000). Each of next Q lines contains one operation in the format as described above.


Output a hash value h computed from the final matrix B by using following pseudo source code.

h <- 314159265
for r = D...E
  for c = F...G
    h <- (31 * h + B_{r,c}) mod 1,000,000,007

where "<-" is a destructive assignment operator, "for i = S...T" indicates a loop for i from S to T (both inclusive), and "mod" is a remainder operation.

Sample Input 1

2 1 3 6 12 1 2 1 2
WR 1 1 1

Output for the Sample Input 1


Sample Input 2

2 1 3 6 12 1 2 1 2

Output for the Sample Input 2


Sample Input 3

2 1 3 6 12 1 2 1 2

Output for the Sample Input 3


Sample Input 4

39989 6 999983 999979 999961 1 1000 1 1000
SR 1 39989
SC 1 39989

Output for the Sample Input 4


Source: ACM-ICPC Japan Alumni Group Winter Contest 2012 , Tokyo, Japan, 2012-03-10