// #pragma GCC optimize("O3")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include <bits/stdc++.h>
using namespace std;

#define PB emplace_back
// #define int long long
#define ll long long
#define vi vector<int>
#define siz(a) ((int) ((a).size()))
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)
void print(vi n) {rep(i, 0, siz(n) - 1) cerr << n[i] << " \n"[i == siz(n) - 1];}

struct FLOW {
	static const int N = 2e5, inf = 1e9;
	int head[N + 5], S, T, dep[N + 5], cur[N + 5], top;
	struct road {
		int lst, v, val;
	} s[N + 5];
	void init(int n) {
		S = n + 1, T = n + 2;
		rep(i, 1, T) head[i] = 0;
		top = 1;
	}
	inline void add(int l1, int l2, int l3) {
		s[++top] = (road) {head[l1], l2, l3};
		head[l1] = top;
		s[++top] = (road) {head[l2], l1, 0};
		head[l2] = top;
	}
	inline bool bfs() {
		rep(i, 0, T) dep[i] = 0, cur[i] = head[i];
		queue<int> qu;
		qu.push(S);
		dep[S] = 1;
		while (!qu.empty()) {
			int u = qu.front();
			qu.pop();
			for (int i = head[u]; i; i = s[i].lst) {
				int v = s[i].v;
				if (dep[v] || !s[i].val) continue;
				dep[v] = dep[u] + 1;
				qu.push(v);
			}
		}
		return dep[T];
	}
	inline int dfs(int n, int mx) {
		if (n == T) return mx;
		int res = 0;
		for (int i = cur[n]; i; i = s[i].lst) {
			cur[n] = i;
			int v = s[i].v;
			if (dep[v] != dep[n] + 1 || !s[i].val) continue;
			int tmp = dfs(v, min(mx, s[i].val));
			s[i].val -= tmp;
			s[i ^ 1].val += tmp;
			res += tmp;
			mx -= tmp;
			if (!mx) break;
		}
		if (!res) dep[n] = -1;
		return res;
	}
	inline int dinic() {
		int res = 0;
		while (bfs()) res += dfs(S, inf);
		return res;
	}
} S;

const int N = 100;
int a, T, b, s[N + 5][N + 5];
char c[N + 5];
bool vis[N * N * N + 5];

signed main() {
	// freopen(".in", "r", stdin);
	// freopen(".out", "w", stdout);
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	for(cin >> T; T--; ) {
		cin >> a >> b;
		S.init((a - 1) * (b - 1) * 2 + a * b);
		auto id = [&] (int x, int y, int z) {
			if(z == 0) return (x - 1) * b + y;
			else if(z == 1) return (x - 1) * (b - 1) + y + a * b;
			else return (x - 1) * (b - 1) + y + a * b + (a - 1) * (b - 1);
		};
		rep(i, 1, a) {
			cin >> c + 1;
			rep(j, 1, b) {
				if(c[j] == 'W') s[i][j] = 0  ^ ((i + j) & 1);
				else if(c[j] == 'B') s[i][j] = 1 ^ ((i + j) & 1);
				else s[i][j] = 2;
				if(s[i][j] == 0) S.add(S.S, id(i, j, 0), 1e9);
				else if(s[i][j] == 1) S.add(id(i, j, 0), S.T, 1e9);
			}
		}
		// rep(i, 1, a) rep(j, 1, b) cout << s[i][j] << " \n"[j == b];
		int cnt = 0;
		rep(i, 1, a - 1) rep(j, 1, b - 1) {
			bool vis[3] = {0, 0, 0};
			// S.add(id(i, j, 1), id(i, j, 2), 1e9);
			vis[s[i][j]] = vis[s[i + 1][j]] = vis[s[i][j + 1]] = vis[s[i + 1][j + 1]] = 1;
			if(!vis[0]) {
				S.add(id(i, j, 2), S.T, 1);
				S.add(id(i, j, 0), id(i, j, 2), 1e9);
				S.add(id(i, j + 1, 0), id(i, j, 2), 1e9);
				S.add(id(i + 1, j, 0), id(i, j, 2), 1e9);
				S.add(id(i + 1, j + 1, 0), id(i, j, 2), 1e9);
			}
			else ++cnt;
			if(!vis[1]) {
				S.add(S.S, id(i, j, 1), 1);
				S.add(id(i, j, 1), id(i, j, 0), 1e9);
				S.add(id(i, j, 1), id(i, j + 1, 0), 1e9);
				S.add(id(i, j, 1), id(i + 1, j, 0), 1e9);
				S.add(id(i, j, 1), id(i + 1, j + 1, 0), 1e9);
			}
			else ++cnt;
		}
		cout << 2 * (a - 1) * (b - 1) - S.dinic() - cnt << '\n';
		rep(i, 1, S.T) vis[i] = 1;
		queue<int> qu;
		qu.push(S.S);
		vis[S.S] = 0;
		while(siz(qu)) {
			int u = qu.front();
			qu.pop();
			for(int i = S.head[u]; i; i = S.s[i].lst) {
				int v = S.s[i].v, val = S.s[i].val;
				if(vis[v] && val) {
					vis[v] = 0;
					qu.push(v);
				}
			}
		}
		cnt = 0;
		rep(i, 1, a - 1) rep(j, 1, b - 1) {
			bool q[3] = {0, 0, 0};
			q[s[i][j]] = q[s[i + 1][j]] = q[s[i][j + 1]] = q[s[i + 1][j + 1]] = 1;
			if(!q[0] && vis[id(i, j, 2)]) {
				// cout << i << ' ' << j << endl;
				++cnt;
				assert(s[i][j] != 0);
				assert(s[i + 1][j] != 0);
				assert(s[i][j + 1] != 0);
				assert(s[i + 1][j + 1] != 0);
				s[i][j] = s[i + 1][j] = s[i][j + 1] = s[i + 1][j + 1] = 1;
			}
			if(!q[1] && !vis[id(i, j, 1)]) {
				// cout << i << ' ' << j << ' ' << 1 << endl;
				++cnt;
				assert(s[i][j] != 1);
				assert(s[i + 1][j] != 1);
				assert(s[i][j + 1] != 1);
				assert(s[i + 1][j + 1] != 1);
				s[i][j] = s[i + 1][j] = s[i][j + 1] = s[i + 1][j + 1] = 0;
			}
		}
		cerr << cnt << endl;

		rep(i, 1, a) rep(j, 1, b) {
			if(s[i][j] == 2) s[i][j] = 1;
			s[i][j] ^= (i + j) & 1;
			s[i][j] ? cout << 'B' : cout << 'W';
			if(j == b) cout << '\n';
		}
	}
	return cerr << endl << 1.0 * clock() / CLOCKS_PER_SEC << endl, 0;
}