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

const int N = 1010;

int a[N][N], vis[N][N], del[N][N];

int cnt = 1;

const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

struct zzr {
	int x, y, ax, ay;
};

queue <zzr> q;

inline int sol(int x, int y, int ax, int ay) {
	int sum = 0;
	++cnt;
	while (!q.empty()) q.pop();
	vis[x][y] = cnt;
	if (ax == 0) del[x][y] = 1;
	q.push(zzr{x, y, ax, ay});
	while (!q.empty()) {
		int tx = q.front().x, ty = q.front().y, ttx = q.front().ax, tty = q.front().ay; q.pop();
		++sum;
		for (int i = 0; i <= 3; i ++) {
			if (a[tx + dx[i]][ty + dy[i]] == 0 || vis[tx + dx[i]][ty + dy[i]] == cnt) continue;
			vis[tx + dx[i]][ty + dy[i]] = cnt;
			if (ax == 0) del[x][y] = 1;
			if (ax != 0 && a[ttx + dx[i]][tty + dy[i]] == 0) return 0;
			q.push(zzr{tx + dx[i], ty + dy[i], ttx + dx[i], tty + dy[i]});
		}
	}
	if (ax == 0) return sum;
	else return 1;
}

inline int solve() {
	int n, m; cin >> n >> m;
	for (int i = 0; i <= n + 1; i ++)
		for (int j = 0; j <= m + 1; j ++)
			a[i][j] = vis[i][j] = del[i][j] = 0;
	for (int i = 1; i <= n; i ++)
		for (int j = 1; j <= m; j ++) {
			char ch;
			cin >> ch;
			if (ch == 'O') a[i][j] = 0;
			else a[i][j] = 1;
		}
	for (int i = 1; i <= n; i ++)
		for (int j = 1; j <= m; j ++) {
			if (del[i][j] || a[i][j] == 0) continue;
			int f = 0;
			for (int i1 = 1; i1 <= n; i1 ++) {
				for (int j1 = 1; j1 <= m; j1 ++)
					if (a[i1][j1] && (i1 != i || j1 != j) && sol(i, j, i1, j1)) { f = 1; break; }
				if (f) break;
			}
			if (!f) return sol(i, j, 0, 0);
			else sol(i, j, 0, 0);
		}
	return 0;
}
int main() {
	ios_base::sync_with_stdio(false), cin.tie(nullptr);
	int T; cin >> T;
	while (T--) cout << solve() << '\n';
	return 0;
}