#include <bits/stdc++.h>
using namespace std;
int main(){
    ios::sync_with_stdio(0),cin.tie(0);
    auto solve =[&](){
        int n,m;
        cin >> n >> m;
        vector <vector <char>> a(n + 10,vector <char>(m + 10));
        vector <pair<int,int>> path ;
        vector <pair<int,int>> dot;
        vector <vector <int>> vis(n + 10,vector <int> (m + 10));
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                cin >> a[i][j];
                if(a[i][j]=='.') dot.push_back({i,j});
            }
        }
        int len = dot.size();
        auto init = [&](int i,int j){
            for(auto &[x,y] : path){
                vis[i+x][j+y] = 0;
            }
        };
        vector <int> dx = {1,-1,0,0};
        vector <int> dy = {0,0,1,-1};
        auto dfs = [&](auto &dfs,int x,int y,int tx,int ty){
            if(vis[x][y]) return;
            vis[x][y] = 1;
            path.push_back({tx,ty});
            for(int i=0;i<4;i++){
                int bx = x + dx[i];
                int by = y + dy[i];
                
                if(bx >=1 && bx<=n && by>=1 && by<=m && a[bx][by]=='.' && vis[bx][by]==0){
                    dfs(dfs,bx,by,tx + dx[i],ty + dy[i]);
                }
            }
        };
        int ans = 0;
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                if(a[i][j] == '.'){
                    path.clear();
                    dfs(dfs,i,j,0,0);
                    int sum = 0;
                    for(auto &[x,y] : dot){
                        for(auto &[tx,ty] : path){
                            int bx = x + tx;
                            int by = y + ty;
                            if(bx <1 || bx > n || by < 1 || by > m|| a[bx][by]=='O'){
                                sum ++ ;
                                break;
                            }
                        }
                    }
                    init(i,j);
                    if(sum == (int) len- 1){
                        ans ++ ;
                    }
                }
            }
        }
        cout << ans << "\n";
     };
    int t;
    cin >> t;
    while(t--){
        solve();
    }
    return 0;
}