1 #include<iostream>
  2 #include<cstring>
  3 #include<cstdio>
  4 #include<algorithm>
  5 #include<vector>
  6 #include<queue>
  7 using namespace std;
  8 typedef pair<int, int> Pair ;
  9 typedef long long ll;
 10 const int INF = 0x3f3f3f3f;
 11 const int maxn = 2500 + 10;
 12 vector<int>G[maxn];
 13 int cx[maxn], cy[maxn];
 14 int cntx, cnty;
 15 bool vis[maxn];
 16
 17 void init(int n)
 18 {
 19     for(int i = 0; i <= n; i++)G[i].clear();
 20 }
 21 bool dfs(int u)
 22 {
 23     for(int i = 0; i < G[u].size(); i++)
 24     {
 25         int v = G[u][i];
 26         if(!vis[v])
 27         {
 28             vis[v] = 1;
 29             if(cy[v] == -1 || dfs(cy[v]))
 30             {
 31                 cx[u] = v;
 32                 cy[v] = u;
 33                 return true;
 34             }
 35         }
 36     }
 37     return false;
 38 }
 39
 40 int maxmatch()
 41 {
 42     memset(cx, -1, sizeof(cx));
 43     memset(cy, -1, sizeof(cy));
 44     int ans = 0;
 45     for(int i = 1; i <= cntx; i++)
 46     {
 47         if(cx[i] == -1)
 48         {
 49             memset(vis, 0, sizeof(vis));
 50             ans += dfs(i);
 51         }
 52     }
 53     return ans;
 54 }
 55 char Map[55][55];
 56 int T, n, m, cases;
 57 void build_Map()
 58 {
 59     //横向标号
 60     int a[55][55], b[55][55];
 61     memset(a, 0, sizeof(a));
 62     memset(b, 0, sizeof(b));
 63     cntx = cnty = 0;
 64     for(int i = 0; i < n; i++)
 65     {
 66         for(int j = 0; j < m; j++)
 67         {
 68             if(Map[i][j] == 'o')
 69             {
 70                 a[i][j] = ++cntx;
 71                 j++;
 72                 while(j < m && Map[i][j] != '#')
 73                     a[i][j] = a[i][j - 1], j++;
 74             }
 75         }
 76     }
 77     //竖向编号
 78     for(int j = 0; j < m; j++)
 79     {
 80         for(int i = 0; i < n; i++)
 81         {
 82             if(Map[i][j] == 'o')
 83             {
 84                 b[i][j] = ++cnty;
 85                 i++;
 86                 while(i < n && Map[i][j] != '#')
 87                     b[i][j] = b[i - 1][j], i++;
 88             }
 89         }
 90     }
 91     init(cntx);//初始化Map
 92     for(int i = 0; i < n; i++)
 93         for(int j = 0; j < m; j++)
 94         if(Map[i][j] == 'o')G[a[i][j]].push_back(b[i][j]);
 95 }
 96 int main()
 97 {
 98
 99     cin >> T;
100     while(T--)
101     {
102         cin >> n >> m;
103         for(int i = 0; i < n; i++)cin >> Map[i];
104         build_Map();
105         printf("Case :%d\n", ++cases);
106         cout<<maxmatch()<<endl;
107     }
108     return 0;
109 }