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

const int 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 * N];
pii kang[N]; int len = 0;

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

void solve() {
    len = 0;
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; ++i) {
        scanf("%s", str[i] + 1);
        for (int j = 1; j <= m; ++j) {
            if (str[i][j] == '.') {
                kang[++len] = {i, j};
            }
        }
    }
    int cnt = 0;
    for (int i = 1; i <= len; ++i) {
        cnt += bfs(i);
    }
    printf("%d\n", cnt);
}

int main(int argc, const char * argv[]) {
    int T;
    scanf("%d", &T);
    while (T--) {
        solve();
    }
    return 0;
}