#include <iostream>
#include <cstdio>
#include <bitset>
#include <queue>

const int N = 1e3 + 10;
const int dx[] = {1, 0, 0, -1}, dy[] = {0, 1, -1, 0};
int m, n;
std::bitset<N> d[N];
char s[N][N];

int getid(int x, int y) { return (x - 1) * m + y; }

void solve(int st)
{
	std::queue<int> q;
	q.push(st);
	d[st][st] = true;
	while (!q.empty())
	{
		int id = q.front(), x = (id - 1) / m + 1, y = (id - 1) % m + 1;
		q.pop();
		for (int dir = 0; dir < 4; ++ dir) {
			int nx = x + dx[dir], ny = y + dy[dir], nid = getid(nx, ny);
			if (nx <= 0 || nx > n || ny <= 0 || ny > m || d[st][nid] || s[nx][ny] == 79)
				continue;
			d[st][nid] = true, q.push(nid);
		}
	}
}

void work()
{
	std::cin >> n >> m;
	for (int i = 1; i <= n; ++ i) d[i].reset();
	for (int i = 1; i <= n; ++ i) scanf("%s", s[i] + 1);
	for (int i = 1; i <= n; ++ i)
		for (int j = 1; j <= m; ++ j)
			if (s[i][j] != 79) solve(getid(i, j));
	int res = 0;
	for (int i = 1; i <= n * m; ++ i) {
		if (s[(i - 1) / m + 1][(i - 1) % m + 1] == 79) continue;
		bool flag = true;
		for (int j = 1; j <= n * m; ++ j) {
			if (i == j || s[(j - 1) / m + 1][(j - 1) % m + 1] == 79) continue;
			if ((d[i] & (j > i ? d[j] >> (j - i) : d[j] << (i - j))) == d[i]) {
				flag = false;
				break;
			}
		}
		// if (flag) std::cout << (i - 1) / m + 1 << ' ' << (i - 1) % m + 1 << '\n';
		res += flag;
	}
	printf("%d\n", res);
}

int main()
{
	int T;
	std::cin >> T;
	while (T --) work();
	return 0;
}