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

/**
 * Codeforces Round #137 (Div. 2), B
 * @author Roman Kosenko <madkite@gmail.com>
 */
public class Main {
	public static void main(String... args) throws IOException {
		long time = 0;
		if(args.length != 0) {
			System.setIn(new FileInputStream(args[0]));
			time = System.currentTimeMillis();
		} else if(!Boolean.parseBoolean(System.getProperty("ONLINE_JUDGE"))) {
			main("in/C222B.1.txt");
			main("in/C222B.2.txt");
			//main("input.txt");
			return;
		}
		BufferedOutputStream os = new BufferedOutputStream(System.out);
		FastScanner scanner = new FastScanner(System.in);
		int n = scanner.nextUnsigned(), m = scanner.nextUnsigned(), k = scanner.nextUnsigned();
		byte[][][] a = new byte[n][m][];
		byte[] buffer = new byte[8];
		for(int i = 0; i < n; i++) {
			byte[][] ai = a[i];
			for(int j = 0; j < m; j++) {
				int size = scanner.nextWord(buffer);
				byte[] aij = new byte[size + 1];
				System.arraycopy(buffer, 0, ai[j] = aij, 0, size);
				aij[size] = 0xa;
			}
		}
		int[] x = new int[n], y = new int[m];
		for(int i = 0; i < n; i++)
			x[i] = i;
		for(int i = 0; i < m; i++)
			y[i] = i;
		for(int i = 0; i < k; i++) {
			char command = scanner.nextChar();
			int p1 = scanner.nextUnsigned() - 1, p2 = scanner.nextUnsigned() - 1;
			if(command == 'r') {
				int t = x[p1];
				x[p1] = x[p2];
				x[p2] = t;
			} else if(command == 'c') {
				int t = y[p1];
				y[p1] = y[p2];
				y[p2] = t;
			} else //if(command == 'g')
				os.write(a[x[p1]][y[p2]]);
		}
		os.flush();

		if(time != 0)
			System.out.println(System.currentTimeMillis() - time);
	}
}
class FastScanner implements Closeable {
	private final InputStream is;
	private byte[] data = new byte[0x2000];
	private int next, size;
	public FastScanner(InputStream is) {
		this.is = is;
	}
	private boolean read() throws IOException {
		size = is.read(data);
		if(size < 0)
			return false;
		else if(size == 0) {
			int i = is.read();
			if(i < 0)
				return false;
			data[0] = (byte)i;
			size = 1;
		}
		next = 0;
		return true;
	}
	public int nextUnsigned() throws IOException {
		int r;
		do {
			if(next >= size && !read())
				throw new EOFException();
			r = data[next++];
		} while(r < '0' || r > '9');
		r -= '0';
		for(int d; (next < size || read()) && '0' <= (d = data[next++]) && d <= '9';)
			r = r * 10 + d - '0';
		return r;
	}
	public char nextChar() throws IOException {
		int r;
		do {
			if(next >= size && !read())
				throw new EOFException();
			r = data[next++];
		} while(r <= ' ');
		return (char)r;
	}
	public int nextWord(byte[] buffer) throws IOException {
		buffer[0] = (byte)nextChar();
		int result = 1;
		for(int i; (next < size || read()) && (i = data[next++]) > ' ';)
			buffer[result++] = (byte)i;
		return result;
	}
	public void close() throws IOException {
		is.close();
		data = null;
	}
	protected void finalize() throws Throwable {
		close();
		super.finalize();
	}
}
