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.*;

public class CosmicTables {
	public static void main(String[] args) throws IOException {
		BufferedReader buff = new BufferedReader(new InputStreamReader(System.in));
		String[] temp = buff.readLine().split(" ");
		int n = Integer.parseInt(temp[0]);
		int m = Integer.parseInt(temp[1]);
		int k = Integer.parseInt(temp[2]);
		int[][] data = new int[n][m];
		for (int i=0;i<n;i++){
			temp = buff.readLine().split(" ");
			for (int j=0;j<m;j++){
				data[i][j] = Integer.parseInt(temp[j]);
			}
		}
		int[] rowsIndex = new int[n];
		int[] columnsIndex = new int[m];
		for (int i=0;i<n;i++)
			rowsIndex[i] = i;
		for (int i=0;i<m;i++)
			columnsIndex[i] = i;
		for (int i=0;i<k;i++){
			temp = buff.readLine().split(" ");
			if (temp[0].charAt(0) == 'c'){
				int c1 = Integer.parseInt(temp[1]);
				int c2 = Integer.parseInt(temp[2]);
				c1--; c2--;
				int tmp = columnsIndex[c1];
				columnsIndex[c1] = columnsIndex[c2];
				columnsIndex[c2] = tmp;
			}
			else if (temp[0].charAt(0) == 'r'){
				int r1 = Integer.parseInt(temp[1]);
				int r2 = Integer.parseInt(temp[2]);
				r1--; r2--;
				int tmp = rowsIndex[r1];
				rowsIndex[r1] = rowsIndex[r2];
				rowsIndex[r2] = tmp;
			}
			else if (temp[0].charAt(0) == 'g'){
				int r = Integer.parseInt(temp[1]);
				int c = Integer.parseInt(temp[2]);
				System.out.println(data[rowsIndex[r-1]][columnsIndex[c-1]]);
			}
		}
	}
	public static void swapRows(int[][] a, int r1, int r2) {
		int temp;
		for (int i=0;i<a[r1].length;i++){
			temp = a[r1][i];
			a[r1][i] = a[r2][i];
			a[r2][i] = temp;
		}
	}
	public static void swapColumns(int[][] a, int c1, int c2) {
		int temp;
		for (int i=0;i<a.length;i++){
			temp = a[i][c1];
			a[i][c1] = a[i][c2];
			a[i][c2] = temp;
		}
	}
}
