#include <bits/stdc++.h>

using namespace std;

struct DSU {
	vector<int> pa, s;
	DSU(int n) : pa(n), s(n, 1) {
		iota(pa.begin(), pa.end(), 0);
	}
	int find(int x) {
		if (x != pa[x]) {
			pa[x] = find(pa[x]);
		}
		return pa[x];
	}
	bool merge(int a, int b) { // b的祖先依附到a的祖先
		if (joint(a, b)) return false;
		s[pa[a]] += s[pa[b]];
		pa[pa[b]] = pa[a];
		return true;
	}
	bool joint(int a, int b) {
		return find(a) == find(b);
	}
	int size(int x) {
		return s[find(x)];
	}
};

void solve() {
    int n, m;
    cin >> n >> m;
    vector<vector<char>> vec(n + 1, vector<char>(m + 1));
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            cin >> vec[i][j];
        }
    }

    auto getId = [&](int x, int y) {
        return (x - 1) * m + y;
    };

    DSU dsu(n * m + 1);
    vector<vector<int>> vis(n + 1, vector<int>(m + 1));
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            if (vis[i][j] || vec[i][j] != '.') continue;
            const int dx[] = {1, -1, 0, 0};
            const int dy[] = {0, 0, 1, -1};
            queue<pair<int, int>> que;
            que.emplace(i, j);
            vis[i][j] = 1;
            while (!que.empty()) {
                auto [x, y] = que.front();
                // cerr << x << " " << y << "x\n";
                que.pop();
                for (int k = 0; k < 4; k++) {
                    int nx = x + dx[k];
                    int ny = y + dy[k];
                    if (nx <= 0 || nx > n || ny <= 0 || ny > m) continue;
                    if (vis[nx][ny] || vec[nx][ny] == 'O') continue;
                    vis[nx][ny] = 1;
                    que.emplace(nx, ny);
                    dsu.merge(getId(i, j), getId(nx, ny));
                }
            }
        }
    }

    vector<vector<pair<int, int>>> scc(n * m + 1);
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            if (vec[i][j] != '.') continue;
            // cerr << i << " " << j << " " << dsu.find(getId(i, j)) << "\n";
            scc[dsu.find(getId(i, j))].emplace_back(i, j);
        }
    }

    vector<vector<pair<int, int>>> temp;
    for (auto v : scc) {
        if (v.size() != 0) {
            temp.push_back(v);
        }
    }
    swap(temp, scc);

    int ans = 0;
    for (int i = 0; i < (int)scc.size(); i++) {
        set<pair<int, int>> st(scc[i].begin(), scc[i].end());
        bool bl = true;
        for (int j = 0; j < (int)scc.size() && bl; j++) {
            if (i == j) continue;
            int dx = scc[i][0].first - scc[j][0].first;
            int dy = scc[i][0].second - scc[j][0].second;
            int cnt = 0;
            for (auto [x, y] : scc[j]) {
                x += dx;
                y += dy;
                if (st.contains(pair(x, y))) {
                    cnt++;
                }
            }
            if (cnt == (int)st.size()) {
                bl = false;
            }
        }
        if (bl) {
            ans += (int)st.size();
        }
    }

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

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    int t;
    cin >> t;

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

    return 0;
}