#include <bits/stdc++.h>

using i64 = long long;
const int dir[4][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};

int n, m;
std::string s[1010];
bool flag[1000 * 1000 + 10];
int blk[1000 * 1000 + 10];

int zip(int i, int j, int x, int y) {
    return i * m * n * m + j * m * n + x * m + y;
}

std::array<int, 4> unzip(int s) {
    std::array<int, 4> res;
    res[0] = s / (m * n * m);
    res[1] = s / (m * n) % m;
    res[2] = s / m % n;
    res[3] = s % m;
    return res;
}

void bfs(int S) {
    std::queue<int> Q;
    Q.push(S), blk[S] = S, flag[S] = 0;
    while (!Q.empty()) {
        int p = Q.front(); Q.pop();
        std::array<int, 4> t = unzip(p);
        for (int i = 0; i < 4; ++i) {
            int ni = t[0] + dir[i][0], nj = t[1] + dir[i][1];
            int nx = t[2] + dir[i][0], ny = t[3] + dir[i][1];
            if (ni < 0 || ni >= n || nj < 0 || nj >= m || s[ni][nj] == 'O') {
                continue;
            }
            if (nx < 0 || nx >= n || ny < 0 || ny >= m || s[nx][ny] == 'O') {
                flag[S] = 1;
                continue;
            }
            int nxt = zip(ni, nj, nx, ny);
            if (blk[nxt] != -1) {
                continue;
            }
            Q.push(nxt), blk[nxt] = S;
        }
    }
}

int check(int i, int j) {
    for (int x = 0; x < n; ++x) {
        for (int y = 0; y < m; ++y) {
            if (s[x][y] == '.') {
                if (x == i && y == j) {
                    continue;
                }
                if (blk[zip(i, j, x, y)] == -1) {
                    bfs(zip(i, j, x, y));
                }
                if (!flag[blk[zip(i, j, x, y)]]) {
                    return 0;
                }
            }
        }
    }
    return 1;
}

void solve() {
    std::cin >> n >> m;
    for (int i = 0; i < n; ++i) {
        std::cin >> s[i];
    }

    memset(blk, -1, sizeof(blk));
    int ans = 0;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            if (s[i][j] == '.') {
                ans += check(i, j);
            }
        }
    }
    std::cout << ans << "\n";
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int T; std::cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}