#include <bits/stdc++.h>
#define FL(i, a, b) for (int i = (a); i <= (b); ++i)
#define FR(i, a, b) for (int i = (a); i >= (b); --i)
#define fi first
#define se second
#define eb emplace_back
#define Sz(v) ((int)v.size())
using namespace std;
typedef pair<int, int> pii;
constexpr int N = 1e3 + 10;
constexpr int f[4][2] = {0, 1, 1, 0, 0, -1, -1, 0};
int n, m, col, c[N][N];
char mp[N][N];
vector<pii> id;
void Dfs(int x, int y) {
	id.eb(x, y);
	FL(k, 0, 3) {
		int fx = x + f[k][0], fy = y + f[k][1];
		if (x > 0 && x <= n && y > 0 && y <= m &&
			mp[fx][fy] == '.' && !c[fx][fy]) {
			c[fx][fy] = c[x][y];
			Dfs(fx, fy);
		}
	}
}
bool Check(int x, int y) {
	FL(i, 1, n) {
		FL(j, 1, m) {
			if (mp[i][j] == 'O' || c[i][j] == c[x][y]) {
				continue;
			}
			int flag = 1;
			for (auto p: id) {
				int u = i + (p.fi - x), v = j + (p.se - y);
				if (u < 1 || u > n || v < 1 || v > m || mp[u][v] == 'O') {
					flag = 0;
					break;
				}
			}
			if (flag) {
				return 0;
			}
		}
	}
	return 1;
}
void Solve() {
	scanf("%d %d", &n, &m);
	FL(i, 1, n) {
		scanf("%s", mp[i] + 1);
		fill(c[i], c[i] + m + 1, 0);
	}
	int ans = col = 0;
	FL(i, 1, n) {
		FL(j, 1, m) {
			if (mp[i][j] == 'O') continue;
			if (!c[i][j]) {
				id.clear();
				c[i][j] = ++col, Dfs(i, j);
				ans += (Check(i, j)? Sz(id) : 0);
			}
		}
	}
	printf("%d\n", ans);
}
int main() {
	int T;
	scanf("%d", &T);
	while (T--) {
		Solve();
	}
	return 0;
}