import sys
input = sys.stdin.read
from collections import defaultdict

def solve():
    data = input().split()
    idx = 0
    T = int(data[idx])
    idx += 1
    results = []
    
    for _ in range(T):
        n = int(data[idx])
        m = int(data[idx+1])
        k = int(data[idx+2])
        s = data[idx+3]
        idx += 4
        
        vis = [[False] * (m + 2) for _ in range(n + 2)]
        a = [[0] * (m + 2) for _ in range(n + 2)]
        
        lx, ly, rx, ry = 1, 1, n, m
        dx, dy = 0, 0
        
        for c in s:
            if c == 'U':
                dx += 1
                if rx + dx > n: rx -= 1
            elif c == 'D':
                dx -= 1
                if lx + dx < 1: lx += 1
            elif c == 'L':
                dy += 1
                if dy + ry > m: ry -= 1
            elif c == 'R':
                dy -= 1
                if dy + ly < 1: ly += 1
        
        if lx > rx or ly > ry:
            results.append(n * m if k == 0 else 0)
            continue
        
        dx, dy = lx, ly
        vis[dx][dy] = True
        
        for c in s:
            if c == 'U': dx += 1
            elif c == 'D': dx -= 1
            elif c == 'L': dy += 1
            elif c == 'R': dy -= 1
            vis[dx][dy] = True
        
        rx, ry = rx - lx + 1, ry - ly + 1
        
        for i in range(1, n + 1):
            for j in range(1, m + 1):
                if vis[i][j]:
                    a[i][j] += 1
                    a[i + rx][j] -= 1
                    a[i][j + ry] -= 1
                    a[i + rx][j + ry] += 1
        
        ans = 0
        for i in range(1, n + 1):
            for j in range(1, m + 1):
                a[i][j] += a[i - 1][j] + a[i][j - 1] - a[i - 1][j - 1]
                if rx * ry - a[i][j] == k:
                    ans += 1
        
        results.append(ans)
    
    for result in results:
        print(result)

if __name__ == "__main__":
    solve()