#include <iostream>
using namespace std;
const int M = 2003, N = 1000006;
int m, p, n, w, k, mmp[M][M], x, y, val[N], tim = 1, len, t[M][M];
int read(){
	int x = 0;
	char a = getchar();
	while(a < '0' || '9' < a) a = getchar();
	while('0' <= a && a <= '9') x = (x << 1) + (x << 3) + (a ^ 48), a = getchar();
	return x;
}
void write(int x){
	if(x > 9) write(x / 10);
	putchar(x % 10 | 48);
}
int main(){
	m = read(), p = read(), n = read();
	for(int i = 1; i <= p; ++ i){
		w = read(), k = read();
		mmp[w][k] = read() + 1;
	}
	t[x = 1][y = 1] = 1, len = 1;
	for(int i = 1; i <= n; ++ i){
		char a = getchar();
		while(a < 'A' || 'Z' < a) a = getchar();
		if(a == 'Z'){
			w = read(), k = read();
			if(tim - t[w][k] >= len) fputs("-1\n", stdout);
			else write(val[len - (tim - t[w][k])]), putchar('\n');
		}
		else{
			if(a == 'G') x --;
			else if(a == 'D') ++ x;
			else if(a == 'L') y --;
			else ++ y;
			if(!t[x][y] && mmp[x][y]) val[++ len] = mmp[x][y] - 1;
			t[x][y] = ++ tim;
		}
	}
	return 0;
}