#include <bits/stdc++.h>

using ll = long long;

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

    std::vector<std::string> g(n);
    for (int i = 0; i < n; ++ i) {
        std::cin >> g[i];
    }


    n += 2, m += 2;
    {
        std::vector<std::string> f(n);
        for (int i = 0; i < n; ++ i) {
            f[i].resize(m);
        }
        for (int i = 0; i < m; ++ i) {
            f[0][i] = 'O';
            f[n - 1][i] = 'O';
        }
        for (int i = 0; i < n; ++ i) {
            f[i][0] = 'O';
            f[i][m - 1] = 'O';
        }

        for (int i = 0; i < n - 2; ++ i) {
            for (int j = 0; j < m - 2; ++ j) {
                f[i + 1][j + 1] = g[i][j];
            }
        }

        g = std::move(f);
    }

    // for (int i = 0; i < n; ++ i) {
    //     std::cerr << g[i] << "\n";
    // }
    // std::cerr << "\n";

    std::vector dp(n, std::vector(m, std::vector(n, std::vector(m, false))));
    const int dx[] = {0, -1, 0, 1}, dy[] = {1, 0, -1, 0};

    std::queue<std::tuple<int, int, int, int>> q;

    int tot = 0;

    for (int i = 0; i < n; ++ i) {
        for (int j = 0; j < m; ++ j) {
            if (g[i][j] == 'O') {
                continue;
            }
            tot ++;
            for (int x = 0; x < n; ++ x) {
                for (int y = 0; y < m; ++ y) {
                    if (g[x][y] == 'O') {
                        dp[i][j][x][y] = true;
                        q.emplace(i, j, x, y);
                    }
                }
            }
        }
    }

    while (!q.empty()) {
        auto [a, b, c, d] = q.front();
        q.pop();

        for (int k = 0; k < 4; ++ k) {
            int x = a + dx[k], y = b + dy[k];
            int u = c + dx[k], v = d + dy[k];
            if (x < 0 || x >= n || y < 0 || y >= m) {
                continue;
            }
            if (u < 0 || u >= n || v < 0 || v >= m) {
                continue;
            }
            if (g[x][y] == 'O') {
                continue;
            }

            if (dp[x][y][u][v] == false) {
                dp[x][y][u][v] = true;
                q.emplace(x, y, u, v);
            } 
        }
    }

    int ans = 0;
    //std::cerr << dp[1][5][1][6] << " " << dp[1][4][1][5] << "\n";

    for (int i = 0; i < n; ++ i) {
        for (int j = 0; j < m; ++ j) {
            if (g[i][j] == 'O') {
                continue;
            }
            int cnt = 0;
            for (int x = 0; x < n; ++ x) {
                for (int y = 0; y < m; ++ y) {
                    if (x == i && y == j) {
                        continue;
                    }
                    if (g[x][y] == 'O') {
                        continue;
                    }
                    cnt += dp[i][j][x][y];
                }
            }
            //std::cerr << i << " " << j << " " << cnt << "\n";
            if (cnt == tot - 1) {
                ans ++;
            }
        }
    }

    std::cout << ans << "\n";
}

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

    int T;
    std::cin >> T;

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

    return 0;
}