#include<bits/stdc++.h>
using namespace std;

void run() {
        int n, m; cin >> n >> m;
        string grid[n]; for (auto &s : grid) cin >> s;

        map<int,map<int,set<int>>> can;

        for (int i = 0; i < n; i++) {
                for (int j = 0; j < m; j++) {
                        if (grid[i][j] == 'O') continue;
                        function<void(int, int, vector<bool>&)> dfs = [&](int k, int l, vector<bool>& vis) {
                                if (k < 0 or k >= n or l < 0 or l >= m) return;
                                if (grid[k][l] == 'O') return;
                                if (vis[k*m+l]) return;
                                vis[k*m+l] = true;
                                can[k-i][l-j].insert(i*m+j);
                                dfs(k-1,l,vis);
                                dfs(k+1,l,vis);
                                dfs(k,l-1,vis);
                                dfs(k,l+1,vis);
                        };
                        vector<bool> vis(n*m);
                        dfs(i, j, vis);
                }
        }

        int ans = 0;
        vector<bool> done(n*m);
        for (int i = 0; i < n; i++) {
                for (int j = 0; j < m; j++) {
                        if (grid[i][j] == 'O') continue;
                        if (done[i*m+j]) continue;
                        function<void(int, int, vector<bool>&, set<int>&)> dfs2 = [&](int k, int l, vector<bool>& vis, set<int>& same) {
                                if (k < 0 or k >= n or l < 0 or l >= m) return;
                                if (grid[k][l] == 'O') return;
                                if (vis[k*m+l]) return;
                                vis[k*m+l] = true;

                                dfs2(k-1,l,vis, same);
                                dfs2(k+1,l,vis, same);
                                dfs2(k,l-1,vis, same);
                                dfs2(k,l+1,vis, same);

                                for (auto it = same.begin(); it != same.end();) {
                                        if (not can[k-i][l-j].count(*it)) {
                                                it = same.erase(it);
                                        } else {
                                                it++;
                                        }
                                }
                        };
                        vector<bool> vis(n*m);
                        set<int> same; for (int x = 0; x < n*m; x++) same.insert(x);
                        dfs2(i, j, vis, same);

                        function<void(int, int, bool)> dfs3 = [&](int k, int l, bool yes) {
                                if (k < 0 or k >= n or l < 0 or l >= m) return;
                                if (grid[k][l] == 'O') return;
                                if (done[k*m+l]) return;

                                ans += yes;
                                done[k*m+l] = true;

                                dfs3(k-1,l,yes);
                                dfs3(k+1,l,yes);
                                dfs3(k,l-1,yes);
                                dfs3(k,l+1,yes);
                        };
                        dfs3(i, j, same.size() == 1);
                }
        }

        cout << ans << '\n';
}

int main() {
        cin.tie(0)->sync_with_stdio(0);
        int t; cin >> t; while (t--) run();
}