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.
/*У Ассоциации Свободных Метеоров (АСМ) возникла проблема: поскольку метеоры движутся, во Вселенско-Космическую Описательную Шуточную Программу (ВКОШП) необходимо добавить специальный модуль, обрабатывающий это движение.

ВКОШП хранит некоторую секретную информацию о метеорах в виде таблицы n × m, в ячейках которой находятся целые числа. В связи со сменой порядка метеоров во Вселенной в главный модуль ВКОШП поступают следующие запросы:

Запрос на обмен местами двух строк таблицы;
Запрос на обмен местами двух столбцов таблицы;
Запрос на получение секретного числа в определенной клетке таблицы.*/

import java.util.Scanner;
import java.io.DataInputStream;
import java.io.InputStream;

public class B
{
    public static void main(String[] args)
    {
        class Parser
        {
            final private int BUFFER_SIZE = 1 << 16;
            private DataInputStream din;
            private byte[] buffer;
            private int bufferPointer, bytesRead;

            public Parser(InputStream in) {
                din = new DataInputStream(in);
                buffer = new byte[BUFFER_SIZE];
                bufferPointer = bytesRead = 0;
            }
            public String nextString(int maxSize) {
                byte[] ch = new byte[maxSize];
                int point = 0;
                try {
                    byte c = read();
                    while (c == ' ' || c == '\n' || c=='\r')
                        c = read();
                    while (c != ' ' && c != '\n' && c!='\r') {
                        ch[point++] = c;
                        c = read();
                    }
                } catch (Exception e) {}
                return new String(ch,0,point);
            }
            public int nextInt() {
                int ret = 0;
                boolean neg;
                try {
                    byte c = read();
                    while (c <= ' ')
                        c = read();
                    neg = c == '-';
                    if (neg)
                        c = read();
                    do {
                        ret = ret * 10 + c - '0';
                        c = read();
                    } while (c > ' ');

                    if (neg) return -ret;
                } catch (Exception e) {}
                return ret;
            }
            public long nextLong() {
                long ret = 0;
                boolean neg;
                try {
                    byte c = read();
                    while (c <= ' ')
                        c = read();
                    neg = c == '-';
                    if (neg)
                        c = read();
                    do {
                        ret = ret * 10 + c - '0';
                        c = read();
                    } while (c > ' ');

                    if (neg) return -ret;
                } catch (Exception e) {}
                return ret;
            }
            private void fillBuffer() {
                try {
                    bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
                } catch (Exception e) {}
                if (bytesRead == -1) buffer[0] = -1;
            }

            private byte read() {
                if (bufferPointer == bytesRead) fillBuffer();
                return buffer[bufferPointer++];
            }
        }

        int[][] data;
        int[] columns;
        int[] rows;

        Parser in = new Parser(System.in);
        int N = in.nextInt();
        int M = in.nextInt();
        int K = in.nextInt();

        data = new int[N][M];
        columns = new int[M];
        rows = new int[N];

        for(int i = 0; i < N; i++)
        {
            for(int j = 0; j < M; j++)
            {
                data[i][j] = in.nextInt();
                columns[j] = j;
            }
            rows[i] = i;
        }
        int temp;
        for(int i = 0; i < K; i++)
        {
            String input = in.nextString(20);
            char op = input.charAt(0);
            int src = in.nextInt();
            int dst = in.nextInt();
            src--; dst--;
            /*(switch (op)
            {
                case 'g':
                    System.out.println(data[rows[src]][columns[dst]]);
                    break;
                case 'c':
                    temp = columns[src];
                    columns[src] = columns[dst];
                    columns[dst] = temp;
                    break;
                case 'r':
                    temp = rows[src];
                    rows[src] = rows[dst];
                    rows[dst] = temp;
                    break;
            }  */
            if(op == 'g')
            {
                System.out.println(data[rows[src]][columns[dst]]);
                continue;
            }
            if(op == 'c')
            {
                temp = columns[src];
                columns[src] = columns[dst];
                columns[dst] = temp;
                continue;
            }
            if(op == 'r')
            {
                temp = rows[src];
                rows[src] = rows[dst];
                rows[dst] = temp;
                continue;
            }
        }
    }
}
