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.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Scanner;
import java.util.StringTokenizer;




public class CosmicTables {
	
	static InputReader input;
	static PrintWriter output;

	public static void main(String[] args) throws FileNotFoundException {
//		System.setIn(new FileInputStream(new File("./src/input")));
		InputStream inputStream = System.in;
	    OutputStream outputStream = System.out;
	    input = new InputReader(inputStream);
	    output = new PrintWriter(outputStream);
	    solve();
	    output.close();
	}
	private static void solve()
	{	

		int n,m,k;
		n = input.nextInt();
		m = input.nextInt();
		k = input.nextInt();
		int[][] table = new int[n][m];
		for(int i=0; i<n; ++i)
			for(int j=0; j<m; ++j)
				table[i][j] = input.nextInt();
		InputOutput ioIndex = new InputOutput(n, m);
		String command;
		for(int i=0; i<k; ++i)
		{
			command = input.next();
//			for(int q=0; q<command.length(); ++q)
//				output.println(q + " -> " + command.charAt(q));
			switch(command.charAt(0))
			{
			case 'g':
				output.println(table[ioIndex.getRaw(input.nextInt())][ioIndex.getCol(input.nextInt())]);
				break;
			case 'r':
				ioIndex.changeRaw(input.nextInt(),input.nextInt());
				break;
			case 'c':
				ioIndex.changeCol(input.nextInt(),input.nextInt());
				break;
			
			}
		}
	}
	

	static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }
        
        public String nextLine(){
        	String line;
            try {
                line = reader.readLine();
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        	return line;
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
	
}
class InputOutput{
	int[] raw,col;
	public InputOutput(int n, int m)
	{
		raw = new int[n];
		col = new int[m];
		for(int i=0; i<n; ++i)
			raw[i] = i;
		for(int i=0; i<m; ++i)
			col[i] = i;
		
	}
	public void changeCol(int index1, int index2)
	{
		swap(--index1,--index2, col);

	}
	public void changeRaw(int index1, int index2)
	{
		swap(--index1,--index2, raw);

	}
	private void swap(int index1, int index2, int[] array) {
		int temp = array[index1];
		array[index1] = array[index2];
		array[index2] = temp;
	}
	public int getRaw(int index){ return raw[--index];}
	public int getCol(int index){ return col[--index];}
}











