class Cumsum2:
    def __init__(self,lst,mod=0):
        self.H=len(lst)
        self.W=len(lst[0]) if lst else 0
        self.cumsum2=[[0]*(self.W+1) for i in range(self.H+1)]
        for i in range(1,self.H+1):
            for j in range(1,self.W+1):
                self.cumsum2[i][j]=lst[i-1][j-1]
        self.mod=mod
        for i in range(self.H+1):
            for j in range(1,self.W+1):
                self.cumsum2[i][j]+=self.cumsum2[i][j-1]
                if self.mod:
                    self.cumsum2[i][j]%=self.mod
        for i in range(1,self.H+1):
            for j in range(self.W+1):
                self.cumsum2[i][j]+=self.cumsum2[i-1][j]
                if self.mod:
                    self.cumsum2[i][j]%=self.mod

    def __getitem__(self,tpl):
        ab,cd=tpl
        def make_slice(ij,N):
            if type(ij)==int:
                i,j=ij,ij+1
            else:
                i,j=ij.start,ij.stop
                if i==None:
                    i=0
                elif i<-N or N<i:
                    raise IndexError("list index out of range")
                elif -N<=i<0:
                    i+=N
                if j==None:
                    j=N
                elif j<-N or N<j:
                    raise IndexError("list index out of range")
                elif -N<=j<0:
                    j+=N
            return i,j
        a,b=make_slice(ab,self.H)
        c,d=make_slice(cd,self.W)
        retu=self.cumsum2[b][d]+self.cumsum2[a][c]-self.cumsum2[a][d]-self.cumsum2[b][c]
        if self.mod:
            retu%=self.mod
        return retu

    def __str__(self):
        return str(self.cumsum2)

T=int(input())
for t in range(T):
    N,M,K=map(int,input().split())
    S=input()
    le=len(S)
    x0,x1=0,N
    y0,y1=0,M
    x,y=0,0
    X,Y=[x],[y]
    for s in S:
        if s=="U":
            x-=1
        elif s=="D":
            x+=1
        elif s=="R":
            y-=1
        else:
            y+=1
        x0=max(x0,x)
        x1=min(x1,N+x)
        y0=max(y0,y)
        y1=min(y1,M+y)
        X.append(x)
        Y.append(y)
    x1=max(x1,x0)
    y1=max(y1,y0)
    minX=min(X)
    minY=min(Y)
    for i in range(le+1):
        X[i]-=minX
        Y[i]-=minY
    leX=max(X)+1
    leY=max(Y)+1
    C=[[0]*leY for x in range(leX)]
    for x,y in zip(X,Y):
        C[x][y]=1
    C=Cumsum2(C)
    ans=0
    for x in range(N):
        for y in range(M):
            dx,dy=x-X[0],y-Y[0]
            if (x1-x0)*(y1-y0)==K+C[min(leX,max(0,x0-dx)):min(leX,x1-dx),min(leY,max(0,y0-dy)):min(leY,y1-dy)]:
                ans+=1
    print(ans)