#include <bits/stdc++.h>

using i64 = long long;

// 9:05

const std::vector<std::pair<int, int>> moves{{-1, 0}, {1, 0}, {0, -1}, {0, 1}};

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 = [&](const int &a, const int &b, const int &c, const int &d) -> int {
        return a * m * n * m + b * n * m + c * m + d;
    };

    auto ungao = [&](const int &mask, int &a, int &b, int &c, int &d) -> void {
        a = mask / (m * n * m);
        b = mask / (n * m) % m;
        c = mask / m % n;
        d = mask % m;
    };

    int cnt = 0;
    std::vector<bool> win(n * m * n * m + 1);
    std::vector<int> col(n * m * n * m, -1);

    auto fall = [&](const int &x, const int &y) -> bool {
        return (x < 0 || y < 0 || x >= n || y >= m || s[x][y] == 'O');
    };

    auto work = [&](const int &S) -> void {
        std::queue<int> q;
        q.emplace(S);
        col[S] = ++cnt;
        int a, b, c, d;

        while (!q.empty()) {
            int u = q.front();
            q.pop();

            ungao(u, a, b, c, d);
            for (const auto &[dx, dy] : moves) {
                int na = a + dx, nb = b + dy;
                int nc = c + dx, nd = d + dy;

                if (fall(na, nb)) {
                    continue;
                }
                if (fall(nc, nd)) {
                    win[cnt] = true;
                    continue;
                }
                int mask = gao(na, nb, nc, nd);
                if (col[mask] == cnt) {
                     continue;
                }
                col[mask] = cnt;
                q.emplace(mask);
            }
        }
    };

    auto check = [&](const int &a, const int &b) -> bool {
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                if (s[i][j] == 'O' || (i == a && j == b)) {
                    continue;
                }
                int mask = gao(a, b, i, j);
                if (col[mask] == -1) {
                    work(mask);
                }
                if (!win[col[mask]]) {
                    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] == 'O') {
                continue;
            }
            ans += check(i, j);
        }
    }
    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;
}