#include<bits/stdc++.h>
#define fore(i,l,r)	for(int i=(int)(l);i<(int)(r);++i)
#define fi first
#define se second
#define endl '\n'
#define ull unsigned long long
#define ALL(v) v.begin(), v.end()
#define Debug(x, ed) std::cerr << #x << " = " << x << ed;

const int INF=0x3f3f3f3f;
const long long INFLL=1e18;

typedef long long ll;

const int N = 1005;

std::vector<std::pair<int, int>> mv = {{0, -1}, {0, 1}, {-1, 0}, {1, 0}};

int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);
    int t;
    std::cin >> t;
    while(t--){
        int n, m;
        std::cin >> n >> m;
        std::vector<std::string> mp(n + 1);
        std::vector<std::vector<std::vector<std::vector<bool>>>> vis(n + 1, 
            std::vector<std::vector<std::vector<bool>>>(m + 1, 
             std::vector<std::vector<bool>>(n + 1, std::vector<bool>(m + 1, false))));
        auto f = vis;
        fore(i, 1, n + 1){
            std::cin >> mp[i];
            mp[i] = '0' + mp[i];
        }

        auto in = [&](int x, int y) -> bool {
            return x > 0 && x <= n && y > 0 && y <= m;
        };

        std::queue<std::tuple<int, int, int, int>> q;
        fore(x, 1, n + 1)
            fore(y, 1, m + 1)
                if(mp[x][y] == '.')
                    fore(s, 1, n + 1)
                        fore(e, 1, m + 1)
                            if(mp[s][e] == 'O'){
                                f[x][y][s][e] = true;
                                q.push({x, y, s, e});
                            }
        fore(x, 1, n + 1)
            fore(y, 1, m + 1)
                if(mp[x][y] == '.'){
                    fore(j, 1, m + 1){
                        q.push({x, y, 0, j});
                        q.push({x, y, n + 1, j});
                    }
                    fore(i, 1, n + 1){
                        q.push({x, y, i, 0});
                        q.push({x, y, i, m + 1});
                    }
                }
        
        while(!q.empty()){
            auto [x, y, s, e] = q.front();
            q.pop();
            for(auto [dx, dy] : mv){
                int xx = x + dx, yy = y + dy;
                int ss = s + dx, ee = e + dy;
                if(in(xx, yy) && mp[xx][yy] == '.' && in(ss, ee) && !f[xx][yy][ss][ee]){
                    f[xx][yy][ss][ee] = true;
                    q.push({xx, yy, ss, ee});
                }
            }
        }

        
        int ans = 0;
        fore(x, 1, n + 1)
            fore(y, 1, m + 1){
                if(mp[x][y] != '.') continue;
                int cnt = 0;
                fore(s, 1, n + 1)
                    fore(e, 1, m + 1)
                        cnt += f[x][y][s][e];
                ans += (cnt == n * m - 1);
            }


        std::cout << ans << endl;
    }
    
    return 0;
}