#include <bits/stdc++.h>

#define ll long long

int dx[4] = {0, 0, 1, -1};
int dy[4] = {1, -1, 0, 0};

void solve(){
    int n, m;
    std::cin >> n >> m;
    std::vector<std::string> s(n);

    for (int i = 0; i < n; i++){
        std::cin >> s[i];
    }
    auto gao = [&](int i, int j, int r, int c){
        return (i * m * n * m + j * n * m + r * m + c);
    };
    auto ungao = [&](int mask){
        int i = mask / (n * m * m);
        int j = mask / (n * m) % m;
        int r = mask / m % n;
        int c = mask % m;
        return std::array<int, 4>{i, j, r, c};
    };
    auto fall = [&](int i, int j){
        return i < 0 || j < 0 || i >= n || j >= m || s[i][j] == 'O';
    };

    std::vector<int> vis(n * m * n * m + 10, -1);
    auto flag = vis;

    auto bfs = [&](int mask){
        std::queue<int> q;
        vis[mask] = mask;
        flag[mask] = false;
        q.push(mask);
        while (!q.empty()){
            int S = q.front();
            q.pop();
            auto [i, j, r, c] = ungao(S);
            for (int k = 0; k < 4; k++){
                int ii = i + dx[k], jj = j + dy[k];
                int rr = r + dx[k], cc = c + dy[k];
                if (fall(ii, jj)) {
                    continue;
                }
                if (fall(rr, cc)){
                    flag[mask] = true;
                    continue;
                }
                int next = gao(ii, jj, rr, cc);
                if (vis[next] >= 0) {
                    continue;
                }
                q.push(next);
                vis[next] = mask;
            }
        }
    };

    auto check = [&](int i, int j){
        for (int r = 0; r < n; r++){
            for (int c = 0; c < m; c++){
                if ((r == i && j == c) || s[r][c] != '.') {
                    continue;
                }
                int mask = gao(i, j, r, c);
                if (vis[mask] == -1){
                    bfs(mask);
                }
                if (!flag[vis[mask]]) {
                    return 0;
                }
            }
        }
        return 1;
    };

    int ans = 0;
    for (int i = 0; i < n; i++){
        for (int j = 0; j < m; j++){
            if (s[i][j] == '.'){
                if (check(i, j)){
                    // std::cout << i << ',' << j << '\n';
                    ans++;
                }
            }
        }
    }
    std::cout << ans << '\n';
}   

int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int t;

    std::cin >> t;

    while (t--){
        solve();
    }

    return 0;
}