#pragma comment (linker,"/STACK:102400000,102400000")
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <stack>
using namespace std;#define mxn 2600
#define mxe 26000
#define inf 0x3f3f3f3f
struct SAP{int dis[mxn],pre[mxn],gap[mxn],arc[mxn],f[mxe],cap[mxe];int head[mxn],nxt[mxe],vv[mxe],e;void init(){e=0;memset(head,-1,sizeof(head));}void addedge(int u,int v,int c){vv[e]=v,cap[e]=c,nxt[e]=head[u],head[u]=e++;vv[e]=u,cap[e]=0,nxt[e]=head[v],head[v]=e++;}int max_flow(int s,int t,int n){int q[mxn],j,mindis,ans=0,ht=0,tl=1;int u,v,low;bool found,vis[mxn];memset(dis,0,sizeof(dis));memset(gap,0,sizeof(gap));memset(vis,0,sizeof(vis));memset(arc,0,sizeof(arc));memset(f,0,sizeof(f));q[0]=t,vis[t]=true,dis[t]=0,gap[0]=1;while(ht<tl){int u = q[ht++];for(int i=head[u];i!=-1;i=nxt[i]){v = vv[i];if(!vis[v]){vis[v]=true;dis[v]=dis[u]+1;q[tl++]=v;gap[dis[v]]++;arc[v]=head[v];}}}u=s;low=inf;pre[s]=s;while(dis[s]<n){found = false;for(int &i = arc[u];i!=-1;i=nxt[i]){if(dis[vv[i]]==dis[u]-1 && cap[i]>f[i]){found = true; v=vv[i];low = min(low, cap[i]-f[i]);pre[v]=u;u=v;if(u==t){while(u!=s){u=pre[u];f[arc[u]]+=low;f[arc[u]^1]-=low;}ans+=low;low=inf;}break;}}if(found) continue;mindis = n;for(int i=head[u];i!=-1;i=nxt[i]){if(mindis>dis[vv[i]] && cap[i]>f[i]){mindis = dis[vv[j=i]];arc[u]=i;}}if(--gap[dis[u]]==0) return ans;dis[u] = mindis+1;gap[dis[u]]++;u=pre[u];}return ans;}
}sap;
char maze[55][55];
int dx[]={0,1,0,-1};
int dy[]={1,0,-1,0};
int main(){int t,n,m,ca=0;scanf("%d",&t);while(t--){scanf("%d%d",&n,&m);for(int i=1;i<=n;++i) scanf("%s",maze[i]+1);for(int i=0;i<=n+1;++i) maze[i][0]=maze[i][m+1]='D';for(int j=0;j<=m+1;++j) maze[0][j]=maze[n+1][j]='D';sap.init();int src = (n+2)*(m+2);int des = src+1;for(int i=0;i<=n+1;++i){for(int j=0;j<=m+1;++j){int u = i*(m+2)+j;if((i^j)&1){if(maze[i][j]=='D') sap.addedge(u,des,inf);if(maze[i][j]=='.') sap.addedge(src,u,inf);}else {if(maze[i][j]=='.') sap.addedge(u,des,inf);if(maze[i][j]=='D') sap.addedge(src,u,inf);}for(int k=0;k<4;++k){int ii=i+dx[k];int jj=j+dy[k];if(ii<0 || jj<0 || ii>n+1||jj>m+1) continue;int u = i*(m+2)+j;int v = ii*(m+2)+jj;sap.addedge(u,v,1);}}}int mf = sap.max_flow(src,des,des+1);int sum = (n+1)*(m+2)+(n+2)*(m+1);printf("Case %d: %d\n",++ca,sum-mf);}return 0;
}