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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;


public class CFTest31 {

    static BufferedReader br;
    public static void main(String[]args){
        br=new BufferedReader(new InputStreamReader(System.in));
        try{

        	int[]arr=readIntArr();
        	int n=arr[0];
        	int m=arr[1];
        	int k=arr[2];
           
        	char[]ch=new char[k];
        	int [][]val=new int[k][2];
            
            int[][]tab=new int[n][m];
            for(int i=0;i<n;i++){
            	tab[i]=readIntArr();
            }
            for(int i=0;i<k;i++){
            	String str=readLine();
            	String[]s=str.split(" ");
            	ch[i]=s[0].charAt(0);
            	val[i][0]=Integer.parseInt(s[1]);
            	val[i][1]=Integer.parseInt(s[2]);
            }
            br.close();
            int[]r=new int[n];
            int[]c=new int[m];
            for(int i=0;i<n;i++)r[i]=i;
            for(int j=0;j<m;j++)c[j]=j;
            
            for(int i=0;i<k;i++){
            	int a=val[i][0]-1;
            	int b=val[i][1]-1;
            	if(ch[i]=='r'){
            		int tmp=r[a];
            		r[a]=r[b];
            		r[b]=tmp;
            	}else if(ch[i]=='c'){
            		int tmp=c[a];
            		c[a]=c[b];
            		c[b]=tmp;
            	}else{
            		System.out.println(tab[r[a]][c[b]]);
            	}
            }
            

        }catch(IOException e){
            e.printStackTrace();
        }
    }
   
    static public String readLine() throws IOException{
        return br.readLine();
       
    }
    static public long readLong() throws IOException{
        return Long.parseLong(br.readLine());
    }
   
    static public int readInt() throws IOException{
        return Integer.parseInt(br.readLine());
    }
   
    static public int[] readIntArr() throws IOException{
        String[]str=br.readLine().split(" ");
        int arr[]=new int[str.length];
        for(int i=0;i<arr.length;i++)arr[i]=Integer.parseInt(str[i]);
        return arr;
    }
   
    static public double[] readDoubleArr() throws IOException{
        String[]str=br.readLine().split(" ");
        double arr[]=new double[str.length];
        for(int i=0;i<arr.length;i++)arr[i]=Double.parseDouble(str[i]);
        return arr;
    }
    static public long[] readLongArr() throws IOException{
        String[]str=br.readLine().split(" ");
        long arr[]=new long[str.length];
        for(int i=0;i<arr.length;i++)arr[i]=Long.parseLong(str[i]);
        return arr;
    }
   
    static public double readDouble() throws IOException{
        return Double.parseDouble(br.readLine());
    }
}