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

int n, m;
char G[1005][1005];
bool vis[1005][1005];
int dx[]{1, -1, 0, 0}, dy[]{0, 0, 1, -1};
vector<array<int, 2>> pos;

bitset<1005> b[1005][1005][4];

void dfs(int x, int y) {
	if (x < 0 || x >= n || y < 0 || y >= m || G[x][y] == 'O' || vis[x][y]) return ;
	vis[x][y] = true;
	pos.push_back({x, y});
	for (int i = 0; i < 4; i++) {
		dfs(x + dx[i], y + dy[i]);
	}
}

void add(int sx, int sy, int dir, int x, int y) {
	x = abs(x), y = abs(y);
	b[sx][sy][dir][x * n + y] = 1;
}

void solve() {
	cin >> n >> m;
	
	vector<array<int, 2>> all;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cin >> G[i][j];
			if (G[i][j] != 'O') {
				vis[i][j] = false;
				for (int k = 0; k < 4; k++) b[i][j][k].reset();
				all.push_back({i, j});
			}
		}
	}
	
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			if (vis[i][j] || G[i][j] == 'O') continue ;
			pos.clear();
			dfs(i, j);
			
			for (auto e1 : pos) {
				for (auto e2 : pos) {
					int x = e2[0] - e1[0];
					int y = e2[1] - e1[1];
					if (x >= 0 && y >= 0) add(e1[0], e1[1], 0, x, y);
					if (x <= 0 && y >= 0) add(e1[0], e1[1], 1, x, y);
					if (x <= 0 && y <= 0) add(e1[0], e1[1], 2, x, y);
					if (x >= 0 && y <= 0) add(e1[0], e1[1], 3, x, y);
				}
			}
		}
	}
	
	int ans = 0;
	for (auto e1 : all) {
		bool ok = 1;
		for (auto e2 : all) {
			if (e1 == e2) continue ;
			bool flag = 0;
			for (int i = 0; i < 4; i++) {
				if ((b[e1[0]][e1[1]][i] & b[e2[0]][e2[1]][i]) != b[e1[0]][e1[1]][i]) {
					flag = 1;
					break ;
				}
			}
			if (!flag) {
				ok = 0;
				break;
			}
		}
		ans += ok; 
	}
	
	cout << ans << '\n';
}

signed main() {
	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	int T;
	cin >> T;
	while (T--)
	solve();
	return 0;
}

/*
1
1 1
.
*/