#include <bits/stdc++.h>
using namespace std;
static constexpr int maxn = 800 + 5;
static constexpr int maxc = 400 * 400 + 5;

int c[maxc];

int n, m, a[maxn][maxn];
vector<int> ys[maxn];
vector<int> as;

static constexpr int dx[] = {0, 0, -1, 1};
static constexpr int dy[] = {1, -1, 0, 0};
int vis[maxn][maxn], visc;

int ans;
void bfs(int sx, int sy) {
    if (vis[sx][sy] == visc) return;
    queue<pair<int, int>> q;
    auto enqueue = [&](int x, int y){
        vis[x][y] = visc;
        if (c[a[x][y]]++ == 0) ans++;
        as.push_back(a[x][y]);
        q.emplace(x, y);
    };
    enqueue(sx, sy);
    while (not q.empty()) {
        auto [x, y] = q.front(); q.pop();
        for (int d = 0; d < 4; ++d) {
            int nx = x + dx[d], ny = y + dy[d];
            if (vis[nx][ny] == visc) continue;
            nx += dx[d], ny += dy[d];
            if (vis[nx][ny] == visc) continue;
            enqueue(nx, ny);
        }
    }
}

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int t; cin >> t;
    while (t--) {
        int q; cin >> n >> m >> q;
        for (int i = 0; i < n; ++i)
            for (int j = 0; j < m; ++j)
                cin >> a[2 * i + 1][2 * j + 1];
        while (q--) {
            int ox, oy;
            cin >> ox >> oy;
            string p; cin >> p;

            ++visc;

            ox *= 2, oy *= 2;

            vector<int> xs;
            auto put = [&](int x, int y) {
                if (x & 1) {
                    xs.push_back(x);
                    ys[x].push_back(y);
                }
                vis[x][y] = visc;
            };
            int cx = ox, cy = oy;
            for (auto pi : p) {
                if (pi == 'L') {
                    put(--cx, cy);
                    put(--cx, cy);
                } else if (pi == 'R') {
                    put(++cx, cy);
                    put(++cx, cy);
                } else if (pi == 'D') {
                    put(cx, --cy);
                    put(cx, --cy);
                } else {
                    put(cx, ++cy);
                    put(cx, ++cy);
                }
            }

            for (auto x : xs) {
                for (size_t i = 0; i < ys[x].size(); i += 2) {
                    bfs(x, ys[x][i] + 1);
                }
                ys[x].clear();
            }
            cout << ans << '\n';
            ans = 0;
            for (auto ai : as) c[ai] = 0;
            as.clear();
        }
    }
    return 0;
}