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.BufferedWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStreamWriter;
import java.util.HashMap;

public class Main {

    public static void main(String[] args) throws IOException {
        final BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
        final FastScanner reader = new FastScanner(System.in);

        final int n = reader.nextInt();
        final int m = reader.nextInt();
        final int k = reader.nextInt();
        int[][] ints = new int[n][m];
        final HashMap<Integer, Integer> xs = new HashMap<>();
        final HashMap<Integer, Integer> ys = new HashMap<>();

        for (int i = 0; i < n; i++) {
            xs.put(i, i);
            for (int j = 0; j < m; j++) {
                ints[i][j] = reader.nextInt();
            }
        }

        for (int i = 0; i < m; i++) {
            ys.put(i, i);
        }

        for (int i = 0; i < k; i++) {
            char option = reader.nextString().charAt(0);
            int x = reader.nextInt() - 1;
            int y = reader.nextInt() - 1;
            switch (option) {
                case 'g':
                    bw.write(Integer.toString(ints[xs.get(x)][ys.get(y)]));
                    bw.newLine();
                    break;
                case 'c':
                    swap(x, y, ys);
                    break;
                case 'r':
                    swap(x, y, xs);
                    break;
            }
        }
        bw.flush();
    }

    private static void swap(int x, int y, HashMap<Integer, Integer> ys) {
        int aux = ys.get(x);
        ys.put(x, ys.get(y));
        ys.put(y, aux);
    }
}

class FastScanner {
    InputStream is;
    byte buff[] = new byte[1024];
    int currentChar = -1;
    int buffChars = 0;

    public FastScanner(InputStream inputStream){
        is = inputStream;
    }

    public boolean hasNext() throws IOException{
        return buffChars >= 0;
    }
    public int nextChar() throws IOException{
        //if we already have that next char read, just return else input
        if(currentChar == -1 || currentChar >= buffChars){
            currentChar = 0;
            buffChars = is.read(buff);
        }

        if(buffChars <= 0)
            return -1;

        return (char) buff[currentChar++];
    }

    public String nextString() throws IOException{
        StringBuilder bldr = new StringBuilder();
        int ch;
        while(isSpace(ch = nextChar()));

        do {
            bldr.append((char)ch);
        }while(!isSpace(ch = nextChar()));

        return bldr.toString();
    }

    public int nextInt() throws IOException{
        //considering ASCII files--> 8 bit chars,     unicode files has 16 bit chars (byte1 then byte2)
        int result = 0;
        int sign = 1;
        int ch;
        while(isSpace(ch = nextChar()));

        if(ch == '-')	{
            sign = -1;
            ch = nextChar();
        }

        do {
            if(ch < '0' || ch > '9')
                throw new NumberFormatException("Found '" + ch + "' while parsing for int.");

            result *= 10;
            result += ch - '0';
        }while(!isSpace(ch = nextChar()));

        return sign * result;
    }

    public long nextLong() throws IOException{
        //considering ASCII files--> 8 bit chars,     unicode files has 16 bit chars (byte1 then byte2)
        long result = 0;
        int sign = 1;
        int ch;
        while(isSpace(ch = nextChar()));

        if(ch == '-')	{
            sign = -1;
            ch = nextChar();
        }

        do {
            if(ch < '0' || ch > '9')
                throw new NumberFormatException("Found '" + ch + "' while parsing for int.");

            result *= 10;
            result += ch - '0';
        }while(!isSpace(ch = nextChar()));

        return sign * result;
    }
    private boolean isSpace(int ch){
        return ch=='\n' || ch==' ' || ch=='\t' || ch=='\r' || ch == -1;
    }

    public void close()  throws IOException{
        is.close();
    }
}