#include<bits/stdc++.h>

#ifndef ONLINE_JUDGE
#include "debug.h"
#else
#define debug(...) 42
#endif

using i64 = long long;
using STATE = std::array<int, 4>;

namespace ranges = std::ranges;

struct hash {
    size_t operator()(const STATE &p) const {
        return std::hash<int>()(p[0]) ^ std::hash<int>()(p[1]) ^ std::hash<int>()(p[2]) ^ std::hash<int>()(p[3]);
    }
};

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

    std::vector<std::string> a(n); for (auto& ai : a) {std::cin >> ai;}

    std::vector<std::pair<int, int>> pos;//袋鼠的位置

    for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) if (a[i][j] == '.') {pos.emplace_back(i, j);}

    int ans{}; for (auto&[x1, y1] : pos) {
         
        auto valid = [&](int& x, int& y) {return x >= 0 and x < n and y >= 0 and y < m;};

        std::unordered_map<STATE, int, hash> f; auto dfs = [&](auto self, int i1, int j1, int i2, int j2) -> bool {
            STATE now{i1, j1, i2, j2};
            if (f.contains(now)) {return f[now];}
            if (not valid(i2, j2) or a[i2][j2] == 'O') {return f[now] = 1;}
            f[now] = 0;
            for (auto&[di, dj] : {std::make_pair(0, 1), {0, -1}, {1, 0}, {-1, 0}}) {
                int ti{i1 + di}, tj{j1 + dj}; if (valid(ti, tj) and a[ti][tj] != 'O') {
                    f[now] |= self(self, ti, tj, i2 + di, j2 + dj);
                }
            }
            return f[now];
        };

        for (auto&[x2, y2] : pos) if (x1 != x2 or y1 != y2) {dfs(dfs, x1, y1, x2, y2);}

        bool fail{}; for (auto&[x2, y2] : pos) if ((x1 != x2 or y1 != y2) and f[{x1, y1, x2, y2}] != 1) {fail = true; break ;}
        if (not fail) {ans += 1;}
    }

    std::cout << ans << '\n';

}

signed main()
{
    std::cin.tie(nullptr)->sync_with_stdio(false);
    int _(1);
#ifdef tests
    std::cin >> _;
#endif
    while(_--) solve();
    return 0;
}