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.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class CosmicTables {
	public static void main(String[] args) throws IOException {
		BufferedReader reader = new BufferedReader(new InputStreamReader(
				System.in));

		int n, m, k;
		String line = reader.readLine();
		StringTokenizer to = new StringTokenizer(line);
		n = Integer.parseInt(to.nextToken());
		m = Integer.parseInt(to.nextToken());
		k = Integer.parseInt(to.nextToken());
		int[][] array = new int[n][m];
		for (int i = 0; i < array.length; i++) {
			line = reader.readLine();
			to = new StringTokenizer(line);
			for (int j = 0; j < array[i].length; j++) {
				array[i][j] = Integer.parseInt(to.nextToken());
			}
		}
		int row[] = new int[array.length];
		for (int i = 0; i < row.length; i++) {
			row[i] = i;
		}
		int col[] = new int[array[0].length];
		for (int i = 0; i < col.length; i++) {
			col[i] = i;
		}
		for (int i = 0; i < k; i++) {
			line = reader.readLine();
			to = new StringTokenizer(line);
			String l = to.nextToken();
			int a = Integer.parseInt(to.nextToken());
			int b = Integer.parseInt(to.nextToken());
			a--;
			b--;
			if (l.charAt(0) == 'r') {
				int temp = row[a];
				row[a] = row[b];
				row[b] = temp;
			} else if (l.charAt(0) == 'c') {
				int temp = col[a];
				col[a] = col[b];
				col[b] = temp;
			} else {
				System.out.println(array[row[a]][col[b]]);

			}

		}
	}

	public static void swapRows(int r1, int r2, int[][] array) {
		int[] temp = new int[array[0].length];
		for (int i = 0; i < temp.length; i++) {
			temp[i] = array[r1][i];
		}
		for (int i = 0; i < array[0].length; i++) {
			array[r1][i] = array[r2][i];
		}
		for (int i = 0; i < temp.length; i++) {
			array[r2][i] = temp[i];
		}
	}

	public static void swapCol(int r1, int r2, int[][] array) {
		int[] temp = new int[array.length];
		for (int i = 0; i < temp.length; i++) {
			temp[i] = array[i][r1];
		}
		for (int i = 0; i < array.length; i++) {
			array[i][r1] = array[i][r2];
		}
		for (int i = 0; i < temp.length; i++) {
			array[i][r2] = temp[i];
		}
	}
}
