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.
//Problem 3
//Codeforces 222B -- Cosmic Tables
//Meg Rydson, Brian Chren, Chris Johnson

import java.util.*;
import java.io.*;

public class cosmicTables2 {
    
    static void change(int[] z, int x, int y){
         int temp = z[x];
         z[x] = z[y];
         z[y] = temp;
    }
    
    public static void main(String[] args) throws IOException{
        Input.init( System.in );
        PrintWriter out = new PrintWriter(System.out);
        // Scanner scan = new Scanner(System.in);
        int n = Input.nextInt(); // number of columns
        int m = Input.nextInt(); // number of rows
        int k = Input.nextInt(); // Query amount 
       
        int[][] chart = new int[n+1][m+1];
        
         //Fill the 2d Array with the original graph before queries --WORKS
         for(int i = 1; i < chart.length; i++){
             for(int j = 1; j < chart[0].length; j++){
                 chart[i][j] = Input.nextInt();
          }
         }
       
        int[] rows = new int[n+1];//keep the indexes in here
        int[] cols = new int[m+1];//keep the indexes in here
        
        for(int i = 1; i < rows.length; i ++){
            rows[i] = i + 1;
        }
        for(int i = 1; i < cols.length; i ++){
            cols[i] = i + 1;
        }
       
        for(int i = 0; i < k; i ++){
            char si = Input.next().charAt(0);    // command -- either c, g, or r
            int  xi = Input.nextInt(); // index
            int  yi = Input.nextInt(); // index
            
            
            if(si == 'c'){  //swap columns with indexes x and y
               // System.out.println("\nOld cols array: " + Arrays.toString(cols));
                change(cols, xi, yi);    
               // System.out.println("New cols array: " + Arrays.toString(cols));
            }else if(si == 'r'){ //swap rows with indexes x and y
                //System.out.println("Old rows array: " + Arrays.toString(rows));
                change(rows, xi, yi);
                //System.out.println("New rows array: " + Arrays.toString(rows));
            }else if(si == 'g'){ // get the number at x and y
               
               
               out.println(chart[rows[xi]-1][cols[yi]-1]);
            }
        }
        
      
        out.close();
    }
}














//THIS IS A FAST READER
class Input {
    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() );
    }
}