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+1) for x in range(leX+1)]
    for x,y in zip(X,Y):
        C[x+1][y+1]=1
    for x in range(leX+1):
        for y in range(1,leY+1):
            C[x][y]+=C[x][y-1]
    for x in range(1,leX+1):
        for y in range(leY+1):
            C[x][y]+=C[x-1][y]
    def cumsum(a,b,c,d):
        if a>=b or c>=d:
            return 0
        return C[b][d]+C[a][c]-C[a][d]-C[b][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+cumsum(max(0,x0-dx),min(leX,x1-dx),max(0,y0-dy),min(leY,y1-dy)):
                ans+=1
    print(ans)