#include<bits/stdc++.h>
using namespace std;
int n,m,a[410][410],q;
int vis[200000],l[410],r[410];
char c[301000];
#define pb push_back
void sol(){
    scanf("%d%d%d",&n,&m,&q);
    for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)scanf("%d",&a[i][j]);
    for(int i=1;i<=n*m;i++)vis[i]=0;
    for(int i=1;i<=n;i++)l[i]=r[i]=-1;
    for(int oo=1,x,y;oo<=q;oo++){
        scanf("%d%d%s",&x,&y,c+1);int L=strlen(c+1);
        vector<int>X;
        for(int i=1;i<=L;i++){
            if(c[i]=='L'){
                if(l[x]==-1)l[x]=y,X.pb(x);else r[x]=y;
                x--;
            }
            if(c[i]=='R'){
                x++;
                if(l[x]==-1)l[x]=y,X.pb(x);else r[x]=y;
            }
            if(c[i]=='D')y--;
            if(c[i]=='U')y++;
        }
        int ans=0;
        for(int o:X){
            if(l[o]>r[o])swap(l[o],r[o]);
            for(int i=l[o]+1;i<=r[o];i++){
                if(vis[a[o][i]]!=oo)
                vis[a[o][i]]=oo,ans++;
            }
            l[o]=r[o]=-1;
        }
        printf("%d\n",ans);
    }
}
int main(){
    int T;scanf("%d",&T);while(T--)sol();
    return 0;
}