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.

Input

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 ≤ 106.

Next k lines contain queries in the format "si xi yi", where si is one of the characters "с", "r" or "g", and xi, yi are two integers.

  * If si = "c", then the current query is the query to swap columns with indexes xi and yi (1 ≤ x, y ≤ m, x ≠ y); 
  * If si = "r", then the current query is the query to swap rows with indexes xi and yi (1 ≤ x, y ≤ n, x ≠ y); 
  * If si = "g", then the current query is the query to obtain the number that located in the xi-th row and in the yi-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.

Output

For each query to obtain a number (si = "g") print the required number. Print the answers to the queries in the order of the queries in the input.

Examples

Input

3 3 5
1 2 3
4 5 6
7 8 9
g 3 2
r 3 2
c 2 3
g 2 2
g 3 2


Output

8
9
6


Input

2 3 3
1 2 4
3 1 5
c 2 1
r 1 2
g 1 3


Output

5

Note

Let's see how the table changes in the second test case.

After the first operation is fulfilled, the table looks like that:

2 1 4

1 3 5

After the second operation is fulfilled, the table looks like that:

1 3 5

2 1 4

So the answer to the third query (the number located in the first row and in the third column) will be 5.
import java.util.*;
import java.io.*;
import java.text.*;
import java.util.Arrays;
 
public class Main {

  public static void main( String [] args ) throws IOException{
      Scanner scan = new Scanner(System.in);
      in.init( System.in );
      
      PrintWriter pw = new PrintWriter(System.out);
      int matrixRows = in.nextInt();
      int matrixColumns = in.nextInt();
      int qs = in.nextInt();
      
      int matrix[][] = new int[matrixRows][matrixColumns];
      int colSwap[] = new int[matrixColumns];
      int rowSwap[] = new int[matrixRows];
      
      for(int i = 0; i<matrixColumns; i++){
         colSwap[i] = i;
      }
      
      for(int i = 0; i<matrixRows; i++){
         rowSwap[i] = i;
      }
      
      for(int r = 0; r<matrixRows; r++){
         for(int c= 0; c<matrixColumns;c++){
            int curr = in.nextInt();
            matrix[r][c] = curr;
         }
      }
      
      
      for(int i=0; i<qs;i++){
         String character = in.next();
         if( character.equals("c")){
            int col1 = in.nextInt();
            int col2 = in.nextInt();
            int i1 = col1-1;
            int i2 = col2-1;
            
            int temp = colSwap[i1];
            colSwap[i1] = colSwap[i2];
            colSwap[i2] = temp;
         
         }else if(character.equals("r")){
            int row1 = in.nextInt();
            int row2 = in.nextInt();
            int i1 = row1-1;
            int i2 = row2-1;
            
            int temp = rowSwap[i1];
            rowSwap[i1] = rowSwap[i2];
            rowSwap[i2] = temp;
         
         }else{
            int row = in.nextInt();
            int col = in.nextInt();
            int cIndex = colSwap[col-1];
            int rIndex = rowSwap[row-1];
            
            pw.println(matrix[rIndex][cIndex]);
         }
      }
      pw.close();
      
      
      
      
      
      
      /*for(int i=0; i<qs;i++){
         String character = scan.next();
         if( character.equals("c")){
            int col1 = scan.nextInt();
            int col2 = scan.nextInt();
            int i1 = col1-1;
            int i2 = col2-1;
            
            int temp = colSwap[i1];
            colSwap[i1] = colSwap[i2];
            colSwap[i2] = temp;
         
         }else if(character.equals("r")){
            int row1 = scan.nextInt();
            int row2 = scan.nextInt();
            swapRows(matrix, row1-1, row2-1);
         
         }else{ //g
            int row = scan.nextInt();
            int col = scan.nextInt();
            int cIndex = colSwap[col-1];
            
            pw.println(matrix[row-1][cIndex]);
         }
      }
      pw.close();*/
      
  }
}

/** Class for buffered reading int and double values */
class in {
    static BufferedReader reader;
    static StringTokenizer tokenizer;

    /** call this method to initialize reader for InputStream */
    static void init(InputStream input) {
        reader = new BufferedReader(
                     new InputStreamReader(input) );
        tokenizer = new StringTokenizer("");
    }

    /** get next word */
    static String next() throws IOException {
        while ( ! tokenizer.hasMoreTokens() ) {
            //TODO add check for eof if necessary
            tokenizer = new StringTokenizer(
                   reader.readLine() );
        }
        return tokenizer.nextToken();
    }

    static int nextInt() throws IOException {
        return Integer.parseInt( next() );
    }
	
    static double nextDouble() throws IOException {
        return Double.parseDouble( next() );
    }
}