#include <bits/stdc++.h>

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

int n, m;
int cnt;
std::map<std::array<int, 4>, int> blk;
bool flag[100010];
std::string s[1010];

void bfs(std::array<int, 4> S) {
	std::queue<std::array<int, 4>> Q;
	Q.push(S);
	blk[S] = ++cnt;
	flag[blk[S]] = 0;
	while (!Q.empty()) {
		auto t = Q.front(); Q.pop();
		int x = t[2], y = t[3], sx = t[0], sy = t[1];
		for (int i = 0; i < 4; ++i) {
			int nx = x + dir[i][0], ny = y + dir[i][1];
			int ni = sx + dir[i][0], nj = sy + 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[blk[S]] = 1;
				continue;
			}
			std::array<int, 4> nxt = {ni, nj, nx, ny};
			if (blk[nxt]) {
				continue;
			}
			Q.push(nxt);
			blk[nxt] = cnt;
		}
	}
}

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) {
					if (!blk[{i, j, x, y}]) {
						bfs({i, j, x, y});
					}
					if (!flag[blk[{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];
	}

	int ans = 0;
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < m; ++j) {
			if (s[i][j] == '.') {
				// blk.clear();
				// cnt = 0;
				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;
}