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.InputStreamReader;
import java.util.*;

public class CF {public static void main(String[] args){new Solve();}}

class Solve { public Solve(){solve();output();}
    void solve(){try{
        int n = NI();
        int m = NI();
        int k = NI();
        int[][] table = new int[n][m];
        for (int i = 0; i < n; i++)
            for (int j = 0; j < m; j++)
                table[i][j] = NI();
        int[] rows = new int[n];
        int[] cols = new int[m];
        for (int i = 0; i < n; i++)
            rows[i] = i;
        for (int j = 0; j < m; j++)
            cols[j] = j;
        for (int i = 0; i < k; i++) {
            String query = NLn();
            String[] q = query.split("\\s");
            if (q[0].equals("c")) {
                swap(cols, Integer.parseInt(q[1]) - 1, Integer.parseInt(q[2]) - 1);
            } else if (q[0].equals("r")) {
                swap(rows, Integer.parseInt(q[1]) - 1, Integer.parseInt(q[2]) - 1);
            } else {
                sout(table[rows[Integer.parseInt(q[1]) - 1]][cols[Integer.parseInt(q[2]) - 1]]);
            }
        }
     }catch(Exception e){e.printStackTrace();}}

    void swap(int[] s, int i, int j) {
        int t = s[i];
        s[i] = s[j];
        s[j] = t;
    }

    BufferedReader stdin=new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st=new StringTokenizer("");StringBuilder output=new StringBuilder();
    final int INF=Integer.MAX_VALUE;final long LINF=Long.MAX_VALUE;double ND()throws Exception{return Double.parseDouble(NS());}
    void inInt(int[]a,int n)throws Exception{for(int i=0;i<n;i++)a[i]=NI();}void inLong(long[]a,int n)throws Exception{for(int i=0;i<n;i++)a[i]=NL();}
    int min(int i1,int i2){return i1<i2?i1:i2;}long min(long i1,long i2){return i1<i2?i1:i2;}
    int max(int i1,int i2){return i1>i2?i1:i2;}long max(long i1,long i2){return i1>i2?i1:i2;}
    String NS()throws Exception{while(!st.hasMoreTokens())st=new StringTokenizer(stdin.readLine());return st.nextToken();}
    int NI()throws Exception{return Integer.parseInt(NS());}long NL()throws Exception{return Long.parseLong(NS());}
    int abs(int x){return x<0?-x:x;}long abs(long x){return x<0?-x:x;}String NLn()throws Exception{return stdin.readLine();}
    int mod(int x,int mod){return(x+mod)%mod;}void output(){System.out.print(output);}void sout(){output.append('\n');}
    void sout(int x){output.append(x).append('\n');}void out(int x){output.append(x);}void sout(StringBuilder x){output.append(x).append('\n');}
    void sout(long x){output.append(x).append('\n');}void out(long x){output.append(x);}void out(StringBuilder x){output.append(x);}
    void sout(char x){output.append(x).append('\n');}void out(char x){output.append(x);}
    void sout(float x){output.append(x).append('\n');}void out(float x){output.append(x);}
    void sout(double x){output.append(x).append('\n');}void out(double x){output.append(x);}
    void sout(String x){output.append(x).append('\n');}void out(String x){output.append(x);}

}
