#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <set>
using namespace std;
typedef long long ll;

int main() {
    int t;
    cin >> t;
    while(t--){
        ll n, m;
        string s;
        cin >> n >> m >> s;
        vector<vector<int> > a(n, vector<int>(m));
        vector<int> sumc(n);
        vector<int> sumr(m);
        for(int i = 0; i < n; i++){
            for(int j = 0; j < m; j++){
                cin >> a[i][j];
                sumc[i] += a[i][j];
                sumr[j] += a[i][j];
            }
        }
        int i = 0, j = 0;
        for(int x = 0; x < s.size(); x++){
            if(s[x] == 'D'){
                a[i][j] = - sumc[i];
                sumc[i] += a[i][j];
                sumr[j] += a[i][j];
                i++;
            }
            if(s[x] == 'R'){
                a[i][j] = - sumr[j];
                sumc[i] += a[i][j];
                sumr[j] += a[i][j];
                j++;
            }
        }
        a[i][j] = -sumr[j];
        cout << endl;
        for(int i = 0; i < n; i++){
            for(int j = 0; j < m; j++){
                cout << a[i][j] << " ";
            }
            cout << endl;
        }
    }
}