#include<bits/stdc++.h>

using namespace std;

vector<vector<char>> x;
vector<vector<int>> f;

int main() {
	int t; cin >> t;
	for (int i = 0; i < t; i++) {
		int n, m; scanf("%d%d", &n, &m);
		vector<vector<char>> x(n, vector<char>(m, 0));
		vector<vector<int>> f(n, vector<int>(m, 0));
		int t = 0, s, xt = 0, yt = 0;
		for (int i = 0; i < n; i++)for (int j = 0; j < m; j++)cin >> x[i][j];
		for (int i = 0; i < n; i++)for (int j = 0; j < m; j++) {
			cin >> s;
			int p, q;
			if (x[i][j] == 'u') {
				p = i - s;
				q = j;
			}
			if (x[i][j] == 'd') {
				p = i + s;
				q = j;
			}
			if (x[i][j] == 'r') {
				p = i;
				q = j + s;
			}
			if (x[i][j] == 'l') {
				p = i;
				q = j - s;
			}
			if (p >= 0 && p < n && q >= 0 && q < m) {
				if (!f[p][q]) {
					t++;
					f[p][q] = 1;
				}
			}
			else {
				xt = i;
				yt = j;
			}
		}
		cout << t << " " << xt << " " << yt << "\n";
		if (n * m == 1)
			printf("Yes\n");
		else if (t >= n * m - 1 && f[xt][yt])
			printf("Yes\n");
		else
			printf("No\n");
	}
	return 0;
}