#include <bits/stdc++.h>
#define rep(i, l, r) for (int i = l; i <= r; i++)
#define per(i, r, l) for (int i = r; i >= l; i--)
#define srep(i, l, r) for (int i = l; i < r; i++)
#define sper(i, r, l) for (int i = r; i > l; i--)
#define maxn 422
#define pii pair<int, int>
#define fi first
#define se second
using namespace std;

int n, m, q;
int a[maxn][maxn];

int ct[maxn * maxn];
int dir[maxn][maxn];
bool vis[maxn][maxn];

bool judge(int x, int y) {
	return !vis[x][y] && 1 <= x && x <= n && 1 <= y && y <= m;
}

int di[4][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};

char s[maxn * maxn << 2]; int l;
int lis[maxn * maxn], cs = 0;
int rlis[maxn * maxn][2], cr = 0;
bool havv[maxn * maxn];

bool get_numx(int x, int y) {
	bool num = 0;
	rep(i, x, n) if (!((dir[i][y] >> 1) & 1)) num ^= 1; 
	return num;
}
bool get_numy(int x, int y) {
	bool num = 0;
	rep(i, y, m) if (!((dir[x][i] >> 3) & 1)) num ^= 1; 
	return num;
}
pii get_st(int x, int y) {
	int i = 1;
	if (s[i] == 'L') {
		if (get_numy(x, y)) return pii(x, y);
		if (get_numy(x, y + 1)) return pii(x, y + 1);
	}
	else if (s[i] == 'R') {
		if (get_numy(x + 1, y)) return pii(x + 1, y);
		if (get_numy(x + 1, y + 1)) return pii(x + 1, y + 1);
	}
	else if (s[i] == 'D') {
		if (get_numx(x + 1, y)) return pii(x + 1, y);
		if (get_numx(x, y)) return pii(x, y);
	}
	else {
		if (get_numx(x + 1, y + 1)) return pii(x + 1, y + 1);
		if (get_numx(x, y + 1)) return pii(x, y + 1);
	}
}

//pii que[maxn * maxn]; int cq = 0, ch = 0;
queue<pii> que;

void update(pii _op) {
	vis[_op.fi][_op.se] = 1;
	++cr; rlis[cr][0] = _op.fi, rlis[cr][1] = _op.se;
	++cs; lis[cs] = a[_op.fi][_op.se];
	ct[lis[cs]]++;
	havv[lis[cs]] = 1;
}

void work(int x, int y, int d) {
	if (d == 1) {
		rep(i, 1, l) {
			if (s[i] == 'L') {
				dir[x][y + 1] &= (15 - 4);
				dir[x][y] &= (15 - 8);
				x -= 1;
			}
			else if (s[i] == 'R') {
				dir[x + 1][y + 1] &= (15 - 4);
				dir[x + 1][y] &= (15 - 8);
				x += 1;
			}
			else if (s[i] == 'D') {
				dir[x + 1][y] &= (15 - 1);
				dir[x][y] &= (15 - 2);
				y -= 1;
			}
			else {
				dir[x + 1][y + 1] &= (15 - 1);
				dir[x][y + 1] &= (15 - 2);
				y += 1;
			}
		}
		
		pii st = get_st(x, y);
		
		//cerr << x << '@' << y << endl;
		
		//cq = ch = 0;
		
		update(st);
		//que[++ch] = st;
		que.push(st);
		while (!que.empty()) {
			//pii op = que[++cq];
			pii op = que.front(); que.pop();
			rep(i, 0, 3) {
				if (!((dir[op.fi][op.se] >> i) & 1)) continue;
				if (!judge(op.fi + di[i][0], op.se + di[i][1])) continue;
				pii _op = pii(op.fi + di[i][0], op.se + di[i][1]);
				update(_op);
				//que[++ch] = _op;
				que.push(_op);
			}
		}
	}
	else {
		rep(i, 1, cs) ct[lis[i]] = 0;
		rep(i, 1, cr) vis[rlis[i][0]][rlis[i][1]] = 0;
		cs = cr = 0;
		
		rep(i, 1, l) {
			if (s[i] == 'L') {
				dir[x][y + 1] = 15;
				dir[x][y] = 15;
				x -= 1;
			}
			else if (s[i] == 'R') {
				dir[x + 1][y + 1] = 15;
				dir[x + 1][y] = 15;
				x += 1;
			}
			else if (s[i] == 'D') {
				dir[x + 1][y] = 15;
				dir[x][y] = 15;
				y -= 1;
			}
			else {
				dir[x + 1][y + 1] = 15;
				dir[x][y + 1] = 15;
				y += 1;
			}
		}
	}
}

int main(){
	int T; scanf("%d", &T);
	while (T--) {
		scanf("%d%d%d", &n, &m, &q);
		rep(i, 1, n) rep(j, 1, m) dir[i][j] = 15;
		rep(i, 1, n) rep(j, 1, m) scanf("%d", &a[i][j]); 
		rep(i, 1, q) {
			int x, y;
			scanf("%d%d%s", &x, &y, s + 1);
			l = strlen(s + 1);
			work(x, y, 1);
			
			int ans = 0;
			rep(i, 1, cs) if (havv[lis[i]] && ct[lis[i]] > 0) havv[lis[i]] = 0, ans++;
			printf("%d\n", ans);
			
			work(x, y, -1);
		}
	}
	return 0;
}