#include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 5;
int n, m, p[N][N], vis[N][N];
string a[N];
const int dx[4] = {0, 0, 1, -1};
const int dy[4] = {1, -1, 0, 0};
vector<pair<int, int>> v;
int check(int x, int y) {
    // cout << x << ' ' << y << '\n';
    for (auto pr : v) {
        // cout << ">>: " << pr.first << ' ' << pr.second << ' ' << a[x + pr.first][y + pr.second]
        //      << '\n';
        if (x + pr.first > n || x + pr.first < 1 || y + pr.second > m || y + pr.second < 1)
            return 1;
        if (a[x + pr.first][y + pr.second] == 'O') return 1;
    }
    return 0;
}
int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int T;
    cin >> T;
    while (T--) {
        cin >> n >> m;
        for (int i = 1; i <= n; i++) {
            cin >> a[i];
            a[i] = ' ' + a[i];
        }
        int ans = 0;
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= m; j++)
                if (vis[i][j] == 0 && a[i][j] == '.') {
                    queue<pair<int, int>> q;
                    // vector<pair<int, int>> v;
                    v.clear();
                    q.push({i, j});
                    p[i][j] = 1;
                    while (!q.empty()) {
                        pair<int, int> pr = q.front();
                        int x = pr.first, y = pr.second;
                        v.push_back({x - i, y - j});
                        q.pop();
                        for (int i = 0; i < 4; i++)
                            if (x + dx[i] > 0 && x + dx[i] <= n && y + dy[i] > 0 &&
                                y + dy[i] <= m && p[x + dx[i]][y + dy[i]] == 0 &&
                                a[x + dx[i]][y + dy[i]] == '.') {
                                p[x + dx[i]][y + dy[i]] = 1;
                                q.push({x + dx[i], y + dy[i]});
                            }
                    }
                    int flag = 1;
                    for (int k = 1; k <= n; k++) {
                        if (flag == 0) break;
                        for (int l = 1; l <= m; l++)
                            if (a[k][l] == '.' && p[k][l] == 0 && check(k, l) == 0) {
                                // cout << i << ' ' << j << ' ' << k << ' ' << l << '\n';
                                flag = 0;
                                break;
                            }
                    }
                    for (auto pr : v) {
                        // cout << pr.first << ' ' << pr.second << '\n';
                        p[i + pr.first][j + pr.second] = 0;
                        vis[i + pr.first][j + pr.second] = 1;
                    }
                    ans += flag * v.size();
                }
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= m; j++) vis[i][j] = p[i][j] = 0;
        cout << ans << '\n';
    }
}