The Free Meteor Association (FMA) has got a problem: as meteors are moving, the Universal Cosmic Descriptive Humorous Program (UCDHP) needs to add a special module that would analyze this movement. 

UCDHP stores some secret information about meteors as an *n* × *m* table with integers in its cells. The order of meteors in the Universe is changing. That's why the main UCDHP module receives the following queries:
 -  The query to swap two table rows; -  The query to swap two table columns; -  The query to obtain a secret number in a particular table cell. 
As the main UCDHP module is critical, writing the functional of working with the table has been commissioned to you.
The first line contains three space-separated integers *n*, *m* and *k* (1 ≤ *n*, *m* ≤ 1000, 1 ≤ *k* ≤ 500000) — the number of table columns and rows and the number of queries, correspondingly.

Next *n* lines contain *m* space-separated numbers each — the initial state of the table. Each number *p* in the table is an integer and satisfies the inequality 0 ≤ *p* ≤ 10<sup class="upper-index">6</sup>.

Next *k* lines contain queries in the format "*s*<sub class="lower-index">*i*</sub> *x*<sub class="lower-index">*i*</sub> *y*<sub class="lower-index">*i*</sub>", where *s*<sub class="lower-index">*i*</sub> is one of the characters "с", "r" or "g", and *x*<sub class="lower-index">*i*</sub>, *y*<sub class="lower-index">*i*</sub> are two integers.
 -  If *s*<sub class="lower-index">*i*</sub> = "c", then the current query is the query to swap columns with indexes *x*<sub class="lower-index">*i*</sub> and *y*<sub class="lower-index">*i*</sub> (1 ≤ *x*, *y* ≤ *m*, *x* ≠ *y*); -  If *s*<sub class="lower-index">*i*</sub> = "r", then the current query is the query to swap rows with indexes *x*<sub class="lower-index">*i*</sub> and *y*<sub class="lower-index">*i*</sub> (1 ≤ *x*, *y* ≤ *n*, *x* ≠ *y*); -  If *s*<sub class="lower-index">*i*</sub> = "g", then the current query is the query to obtain the number that located in the *x*<sub class="lower-index">*i*</sub>-th row and in the *y*<sub class="lower-index">*i*</sub>-th column (1 ≤ *x* ≤ *n*, 1 ≤ *y* ≤ *m*). 
The table rows are considered to be indexed from top to bottom from 1 to *n*, and the table columns — from left to right from 1 to *m*.
dimensions = input()
dimensions = dimensions.split(' ')
#for i in range(len(dimensions)):
    #dimensions[i]=int(dimensions[i])
table=[]
queries = []
for i in range(int(dimensions[0])):
    values = input()
    values = values.split(' ')
    #for i in range(len(values)):
        #values[i] = int(values[i])
    table.append(values)
rowindx = []
for i in range(int(dimensions[1])):
    rowindx.append(i)
colindx = []
for i in range(int(dimensions[0])):
    colindx.append(i)
for i in range(int(dimensions[2])):
    q = input()
    q = q.split(' ')
    q[1], q[2] = int(q[1])-1, int(q[2])-1
    queries.append(q)
for i in queries:
    if i[0] == 'g':
        print(int(table[int(colindx[i[1]])][int(rowindx[i[2]])]))
        
    if i[0] == 'r':
        colindx[i[1]], colindx[i[2]] = colindx[i[2]], colindx[i[1]]
        
    if i[0] == 'c':
        rowindx[i[1]], rowindx[i[2]] = rowindx[i[2]], rowindx[i[1]]
	 		    	 			  	  					 	 			 	