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.*;
import java.util.*;
public class CosmicTables {

    public static void main(String args[]) throws IOException {
        take();
    }

    public static void take() throws IOException {
//        Scanner sc=new Scanner(new FileReader("t.txt"));
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));
        StringTokenizer st = new StringTokenizer(br.readLine());
        int tr = Integer.parseInt(st.nextToken());
        int tc = Integer.parseInt(st.nextToken());
        int k = Integer.parseInt(st.nextToken());
        int[][] n = new int[tr][tc];
        int[] row = new int[tr];
        int[] col = new int[tc];
        List<Integer> li = new ArrayList<Integer>();
        for (int i = 0; i < tr; i++) {
            st = new StringTokenizer(br.readLine());
//            if (i == 0) {
                row[i] = i;
//            }
            for (int j = 0; j < tc; j++) {

                n[i][j] = Integer.parseInt(st.nextToken());
                if (i == 0) {
                    col[j] = j;
                }
            }
        }
//        for(int i=0;i<tr;i++){
//           System.out.println(row[i]);
//        }
        String q;
        int x1;
        int y1;
        int temp;
        for (int i = 0; i < k; i++) {
            st = new StringTokenizer(br.readLine());
            q = st.nextToken();
            x1 = Integer.parseInt(st.nextToken());
            y1 = Integer.parseInt(st.nextToken());
            if (q.equalsIgnoreCase("c")) {
                temp=col[x1-1];
                col[x1-1]=col[y1-1];
                col[y1-1]=temp;
            } else if (q.equalsIgnoreCase("r")) {
                temp=row[x1-1];
                row[x1-1]=row[y1-1];
                row[y1-1]=temp;
            } else {
//                System.out.println(x1+" "+y1);
//                System.out.println((row[x1-1])+" "+(col[y1-1]));
                pw.println(n[row[x1-1]][col[y1-1]]);
            }
        }



//        for (int i = 0; i < k; i++) {
////            System.out.println(i);
////            v=sc.nextLine();
//            st = new StringTokenizer(br.readLine());
//            q = st.nextToken();
//            x1 = Integer.parseInt(st.nextToken());
//            y1 = Integer.parseInt(st.nextToken());
//            if (q.equalsIgnoreCase("c")) {
//                for (int s = 0; s < n.length; s++) {
//                    temp = n[s][x1 - 1];
//                    n[s][x1 - 1] = n[s][y1 - 1];
//                    n[s][y1 - 1] = temp;
//                }
////                System.out.println((x1-1)+" "+(y1-1));
////                n = colomn(n, x1 - 1, y1 - 1);
//            } else if (q.equalsIgnoreCase("r")) {
////                n = row(n, x1 - 1, y1 - 1);
//                for (int s = 0; s < n[0].length; s++) {
//                    temp = n[x1 - 1][s];
//                    n[x1 - 1][s] = n[y1 - 1][s];
//                    n[y1 - 1][s] = temp;
//                }
//            } else {
//                pw.println(n[x1 - 1][y1 - 1]);
////                pw.close();
//            }
//        }
        pw.close();
//        for(int i=0;i<li.size();i++){
//            System.out.println(li.get(i));
//        }

    }

    public static int[][] colomn(int[][] x, int j, int k) {
        int temp;
//        System.out.println(x.length);
        for (int i = 0; i < x.length; i++) {
            temp = x[i][j];
            x[i][j] = x[i][k];
            x[i][k] = temp;
        }
        return x;
    }

    public static int[][] row(int[][] x, int j, int k) {
        int temp;
        for (int i = 0; i < x[0].length; i++) {
            temp = x[j][i];
            x[j][i] = x[k][i];
            x[k][i] = temp;
        }
        return x;
    }
}
