#include <bits/stdc++.h>

using namespace std;
#define all(x) (x).begin(),(x).end()
typedef long long ll;

template<typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    for (int i = 0; i < int(v.size()); i++) os << v[i] << (i + 1 == int(v.size()) ? "" : " ");
    return os;
}

#ifdef LOCAL
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") \n";
#else
#define debug(x) void(0)
#endif

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

void solve() {
    int n, m;
    cin >> n >> m;
    vector<string> S(n);
    for (auto &s: S) cin >> s;

    int ans = 0;
    vector seen(n, vector<bool>(m, false));
    queue<pair<int, int>> que;
    auto bfs = [&](int sx, int sy) {
        vector<pair<int, int>> res;
        seen[sx][sy] = true;
        que.emplace(sx, sy);
        while (not que.empty()) {
            auto [x, y] = que.front();
            que.pop();
            res.emplace_back(x, y);
            for (int i = 0; i < 4; i++) {
                int nx = x + dx[i], ny = y + dy[i];
                if (nx < 0 or n <= nx or ny < 0 or m <= ny) continue;
                if (S[nx][ny] == 'O') continue;
                if (seen[nx][ny]) continue;
                seen[nx][ny] = true;
                que.emplace(nx, ny);
            }
        }
        return res;
    };
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (seen[i][j] or S[i][j] == 'O') continue;
            auto comp = bfs(i, j);
            bool ok = true;
            for (int di = -n; di <= n and ok; di++) {
                for (int dj = -m; dj <= m and ok; dj++) {
                    if (di == 0 and dj == 0) continue;
                    bool safe = true;
                    for (auto [x, y]: comp) {
                        int nx = x + di, ny = y + dj;
                        if (nx < 0 or n <= nx or ny < 0 or m <= ny or S[nx][ny] == 'O') {
                            safe = false;
                            break;
                        }
                    }
                    if (safe) ok = false;
                }
            }
            if (ok) ans += comp.size();
        }
    }

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

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T;
    cin >> T;
    for (; T--;) solve();
    return 0;
}