#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rof(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
const int Maxn=1e6,inf=1e9,lim=1e5;

int n,m,s,t,vis[Maxn+5],dis[Maxn+5],maxf;
char ch[105][105]; int id[105][105],h[105][105];
struct Node{int frm,to,nxt,w;} Edge[Maxn*2+5];
int tot=1,Head[Maxn+5],cur[Maxn+5];
inline void Addedge(int x,int y,int k)
{
    Edge[++tot]=Node{x,y,Head[x],k},Head[x]=tot;
    Edge[++tot]=Node{y,x,Head[y],0ll},Head[y]=tot;
}

inline int bfs()
{
    queue<int> q; For(i,1,t) dis[i]=vis[i]=0,cur[i]=Head[i];
    dis[s]=0,vis[s]=1,q.push(s);
    while(!q.empty())
    {
        int x=q.front(); q.pop();
        for(int i=Head[x];i;i=Edge[i].nxt)
        {
            int y=Edge[i].to;
            if(Edge[i].w && !vis[y])
                dis[y]=dis[x]+1,vis[y]=1,q.push(y);
        }
    } return vis[t];
}
inline int dfs(int x,int flow)
{
    if(!flow || x==t) {maxf+=flow; return flow;}
    int used=0,res=0;
    for(int i=cur[x];i && used<flow;i=Edge[i].nxt)
    {
        int y=Edge[i].to; cur[x]=i;
        if(dis[y]==dis[x]+1 && Edge[i].w)
            if(res=dfs(y,min(flow-used,Edge[i].w)))
                used+=res,Edge[i].w-=res,Edge[i^1].w+=res;
    } return used;
}
inline void dfs(int x)
{
    vis[x]=1; for(int i=Head[x];i;i=Edge[i].nxt) if(Edge[i].w)
        {int y=Edge[i].to; if(!vis[y]) dfs(y);}
}

inline void Clear() {For(i,1,t) Head[i]=cur[i]=0; tot=1,maxf=0;}
inline void Solve()
{
    cin>>n>>m; s=t=0;
    For(i,1,n) scanf("%s",ch[i]+1);
    For(i,1,n) For(j,1,m) if(i+j&1)
    {
        if(ch[i][j]=='W') ch[i][j]='B';
        else if(ch[i][j]=='B') ch[i][j]='W';
    }
    For(i,1,n) For(j,1,m) h[i][j]=++s;
    For(i,1,n-1) For(j,1,m-1) id[i][j]=++s,++s;
    ++s,t=s+1;
    For(i,1,n) For(j,1,m)
    {
        if(ch[i][j]=='W') Addedge(s,h[i][j],inf);
        if(ch[i][j]=='B') Addedge(h[i][j],t,inf);
        if(ch[i][j]=='?') Addedge(s,h[i][j],1),Addedge(h[i][j],t,1),maxf--;
        if(i<n && j<m) Addedge(id[i][j],id[i][j]+1,1);
    }
    // For(i,1,n) printf("%s\n",ch[i]+1);
    For(i,1,n) For(j,1,m)
    {
        if(i<n && j<m) Addedge(h[i][j],id[i][j],1),Addedge(id[i][j]+1,h[i][j],1);
        if(i>1 && j<m) Addedge(h[i][j],id[i-1][j],1),Addedge(id[i-1][j]+1,h[i][j],1);
        if(i<n && j>1) Addedge(h[i][j],id[i][j-1],1),Addedge(id[i][j-1]+1,h[i][j],1);
        if(i>1 && j>1) Addedge(h[i][j],id[i-1][j-1],1),Addedge(id[i-1][j-1]+1,h[i][j],1);
    }
    while(bfs()) dfs(s,inf); printf("%d\n",(n-1)*(m-1)-maxf);
    For(i,1,t) vis[i]=0; dfs(s);
    For(i,1,n) For(j,1,m) if(vis[h[i][j]]) ch[i][j]='W'; else ch[i][j]='B';
    // For(i,1,n) printf("%s\n",ch[i]+1); printf("\n");
    For(i,1,n) For(j,1,m) if(i+j&1)
    {
        if(ch[i][j]=='W') ch[i][j]='B';
        else if(ch[i][j]=='B') ch[i][j]='W';
    }
    For(i,1,n) printf("%s\n",ch[i]+1); Clear();
}

int main()
{
    // freopen("1.in","r",stdin);
    
    int T; cin>>T;
    while(T--) Solve();
    return 0;
}