#include <bits/stdc++.h>
using namespace std;

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 0
#endif

using i64 = long long;

#define int long long

void solve() {
    int n, m;
    cin >> n >> m;

    vector<string> s(n);
    for (int i = 0; i < n; i++) {
        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 msk) {
        return array<int, 4>{msk / (m * n * m),
                             msk / (n * m) % m,
                             msk / (m) % n,
                             msk % m};
    };
    auto fall = [&](int i, int j) {
        return i < 0 || j < 0 || i >= n || j >= m || s[i][j] == 'O';
    };

    constexpr short dir[4][2] = {0, 1, 1, 0, -1, 0, 0, -1};

    const int M = n * m * n * m;
    vector<int> vis(M, -1), flag(M);

    auto bfs = [&](int S) {
        queue<int> q;
        q.push(S);

        vis[S] = S;

        while (!q.empty()) {
            auto [i, j, r, c] = ungao(q.front());
            q.pop();

            for (int k = 0; k < 4; k++) {
                int ii = i + dir[k][0], jj = j + dir[k][1];
                int rr = r + dir[k][0], cc = c + dir[k][1];

                if (fall(ii, jj)) continue;

                if (fall(rr, cc)) {
                    flag[S] = 1;
                    continue;
                }

                int nxt = gao(ii, jj, rr, cc);
                if (vis[nxt] != -1) continue;
                q.push(nxt);
                vis[nxt] = S;
            }
        }

        debug(ungao(S), flag[S]);
    };

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

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

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}