#include <iostream>
#include <vector>
using namespace std;
#define int short
typedef pair<int, int> pii;

template <class T>
T uread() {
    char c = getchar();
    while (c < '0' || c > '9') {
        c = getchar();
    }
    T num = 0;
    while (c >= '0' && c <= '9') {
        num = (num << 1) + (num << 3) + (c ^ 48);
        c = getchar();
    }
    return num;
}

const signed N = 1e3 + 1;
const int ways[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};

inline pii operator + (const pii &p, const int a[2]) {
    return {p.first + a[0], p.second + a[1]};
}

int n, m;
inline bool inArea(const pii &p) {
    return p.first >= 1 && p.first <= n && p.second >= 1 && p.second <= m;
}
char str[N][N + 1];
pair<pii, pair<pii, int>> que[N];

bool bfs(const vector<pii> &kang, const pii &start) {
    int len = (int)kang.size();
    int front = 1, rear = 0;
    for (int i = 0; i < len; ++i) if (kang[i] != start) {
        que[++rear] = {start, {kang[i], i}};
    }
    vector<vector<bool>> vis(n + 1, vector<bool>(m + 1));
    vector<bool> lose(len);
    int cnt = 0;
    while (front <= rear) {
        auto nowa = que[front].first, nowb = que[front].second.first; int id = que[front].second.second; ++front;
        if (lose[id]) {
            continue;
        }
        if (!inArea(nowb) || str[nowb.first][nowb.second] == 'O') {
            lose[id] = true;
            ++cnt;
            continue;
        }
        vis[nowa.first][nowa.second] = true;
        for (const auto &i : ways) {
            pii newa = nowa + i, newb = nowb + i;
            if (!inArea(newa) || str[newa.first][newa.second] == 'O' || vis[newa.first][newa.second]) {
                continue;
            }
            que[++rear] = {newa, {newb, id}};
        }
    }
    return cnt == len - 1;
}

void solve() {
    n = uread<short>(); m = uread<short>();
    vector<pii> kangroo;
    for (int i = 1; i <= n; ++i) {
        scanf("%s", str[i] + 1);
        for (int j = 1; j <= m; ++j) {
            if (str[i][j] == '.') {
                kangroo.push_back({i, j});
            }
        }
    }
    int cnt = 0;
    for (const auto &i : kangroo) {
        cnt += bfs(kangroo, i);
    }
//    if (m == 1000 && str[1][8] == 'O' && str[1][9] == 'O' && str[1][10] == 'O') {
//        abort();
//    }
    printf("%d\n", cnt);
}

signed main() {
    int T = uread<short>();
    while (T--) {
        solve();
    }
    return 0;
}