bool M1;
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdlib>
#include<climits>
#include<iomanip>
#include<cassert>
#include<random>
#include<cstdio>
#include<vector>
#include<bitset>
#include<stack>
#include<queue>
#include<deque>
#include<cmath>
#include<ctime>
#include<map>
#include<set>
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/hash_policy.hpp>
//#include<ext/pb_ds/priority_queue.hpp>
#define fi first
#define se second
#define LD double
#define ll long long
#define Vector Point
#define I128 __int128
#define ull unsigned ll
#define pii pair<int,int>
#define pb(x) push_back(x)
#define syt cerr<<"sytakioi\n"
#define F(i,a,b) for(int i=a,i##end=b;i<=i##end;++i)
#define UF(i,a,b) for(int i=a,i##end=b;i>=i##end;--i)
#define look_memory cerr<<abs(&M2-&M1)/1024.0/1024<<'\n'
#define rd_i(l,r) uniform_int_distribution<int>(l,r)(rd)
#define rd_r(l,r) uniform_real_distribution<double>(l,r)(rd)
#define look_time cerr<<(clock()-Time)*1.0/CLOCKS_PER_SEC<<'\n'
using namespace std;
//using namespace __gnu_cxx;
mt19937 rd(time(0));
const int N=2005;
int m,p,n,cnt,x=1,y=1;
int a[N][N],t[N][N];
bool M2;
int main(){
	int Time=clock();
	look_memory;
	cin.tie(nullptr)->sync_with_stdio(false);
	cin>>m>>p>>n;
	memset(t,-1,sizeof t);
	t[1][1]=0;
	F(i,1,p){
		int x,y,val;cin>>x>>y>>val;
		a[x][y]=val;
	}
	vector<int> v={0};
	F(i,1,n){
		char c;cin>>c;
		if(c=='Z'){
			int x,y;cin>>x>>y;
			if(cnt-t[x][y]<v.size()) cout<<v[v.size()-(cnt-t[x][y])-1]<<'\n';
			else cout<<"-1\n";
		}else{
			if(c=='G') --x;
			if(c=='D') ++x;
			if(c=='L') --y;
			if(c=='P') ++y;
			t[x][y]=++cnt;
			if(a[x][y]) v.emplace_back(a[x][y]),a[x][y]=0;
		}
	}
	look_time;
	return 0;
}