#include <bits/stdc++.h>
#define ll long long

using namespace std;

const int MOD = 1e9 + 7;

void solve(){
	int n, m;
	cin >> n >> m;
	string s;
	cin >> s;
	
	int a[n][m];
	
	ll s1[n], s2[m];
	memset(s1, 0, sizeof s1);
	memset(s2, 0, sizeof s2);
	for(int i = 0; i < n; i++){
		for(int j = 0; j < m; j++){
			cin >> a[i][j];
			s1[i] += a[i][j];
			s2[j] += a[i][j];
		}
	}
	int x = 0, y = 0;
	for(int i = 0; i < s.size(); i++){
		if(s[i] == 'R'){
			a[x][y] = -s2[y];
			s1[x] += (-s2[y]);
			s2[y] = 0;
			y++;
		}else{
			a[x][y] = -s1[x];
			s2[y] += (-s1[x]);
			s1[x] = 0;
			x++;
		}
	}
	a[n - 1][m - 1] = -s1[n - 1];
	
	for(int i = 0; i < n; i++){
		for(int j = 0; j < m; j++)cout << a[i][j] <<" ";
		cout << "\n";
	}
	
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t = 1;
	cin >> t;
	
	for(int i = 1; i <= t; i++){
		solve();
	}
	return 0;
}