#include<cstdio>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<string.h>
#include<iomanip>
#include<stack>
#include<deque>
#include<queue>
#include<vector>
#include<map>
#include<set>
using namespace std;
typedef long long ll;
ll di[1100][1100], sum[1100][1100];
inline int read() { register int s = 0, w = 1; char ch = getchar(); while (ch < '0' || ch > '9') { if (ch == '-')w = -1; ch = getchar(); }while (ch >= '0' && ch <= '9')s = s * 10 + ch - '0', ch = getchar(); return s * w; }
int main()
{
    ll t; cin >> t;
    while (t--)
    {
        memset(sum, 0, sizeof sum);
        memset(di, 0, sizeof di);
        ll n, m, k; cin >> n >> m >> k;
        string s;
        cin >> s;
        ll a = 1,b=1,x=1,yy=1,le=n,wi=m;
        for (int i = 0; i < s.length(); i++)
        {
            if (s[i] == 'U')
            {
                a--;
                if (a <= 0)
                {
                    wi--;
                    a = 1;
                    x++;
                }
            }
            else if (s[i] == 'D')
            {
                a++;
                if (a+wi-1 > n)
                {
                    wi--;
                }
            }
            else if (s[i] == 'L')
            {
                b--;
                if (b<=0)
                {
                    b = 1; le--; yy++;
                }
            }
            else if (s[i] == 'R')
            {
                b++;
                if (b+le-1 > m)
                {
                    le--;
                }
            }
        }
        if (le <= 0 || wi <= 0)
        {
            if (k == 0)cout << n * m<<'\n';
            else cout << 0<<'\n';
            continue;
        }
        set<pair<ll, ll> >d;
        for (int i = 0; i < s.length(); i++)
        {
            if (!d.count({ x,yy }))
            {
                d.insert({ x,yy });
                di[x][yy]++;
                di[x + wi][yy]--;
                di[x][yy + le]--;
                di[x + wi][yy + le]++;
            }
            if (s[i] == 'U')x--;
            else if (s[i] == 'D')x++;
            else if (s[i] == 'L')yy--;
            else yy++;
            //for (int u= 1; u <= n; u++)
            //{
            //    for (int y = 1; y <= m; y++)
            //    {
            //        cout << di[u][y] << " ";
            //    }
            //    cout << endl;
            //}
            //cout << endl;
        }
        if (!d.count({ x,yy }))
        {
            d.insert({ x,yy });
            di[x][yy]++;
            di[x + wi][yy]--;
            di[x][yy + le]--;
            di[x + wi][yy + le]++;
        }
        //for (int i = 1; i <= n; i++)
        //{
        //    for (int y = 1; y <= m; y++)
        //    {
        //        cout << di[i][y] << " ";
        //    }
        //    cout << endl;
        //}
        //cout << endl;
        ll ans = 0;
        for (int i = 1; i <= n; i++)
        {
            for (int y = 1; y <= m; y++)
            {
                sum[i][y] = sum[i - 1][y] + sum[i][y - 1] - sum[i - 1][y - 1] + di[i][y];
                cout << sum[i][y] << " ";
                if (sum[i][y] == le*wi-k)ans++;
            }
            cout << endl;
        }
        cout << ans << '\n';
    }
}