#include <bits/stdc++.h>
#define ff first
#define ss second
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

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

const int SZ = 1010;

int n, m;
vector<vector<int>> V, F;

bool in(int x, int y) {
	return 0 <= x && x < n && 0 <= y && y < m;
}

pii bst[SZ];
vector<pii> G[SZ];
void dfs(int x, int y, int px, int py) {
	G[F[x][y]].push_back({px, py});
	for (int t = 0; t < 4; t++) {
		int nx = x + dx[t];
		int ny = y + dy[t];
		if (in(nx, ny) && !V[nx][ny] && !F[nx][ny]) {
			F[nx][ny] = F[x][y];
			dfs(nx, ny, px + dx[t], py + dy[t]);
		}
	}
}
map<pii, bool> mp[SZ];

int main() {
	cin.tie(0); ios_base::sync_with_stdio(0);

	int T;
	cin >> T;

	while (T--) {
		cin >> n >> m;
		V = vector<vector<int>>(n, vector<int>(m, 0));
		F = vector<vector<int>>(n, vector<int>(m, 0));

		for (int i = 0; i < n; i++) {
			string S; cin >> S;
			for (int j = 0; j < m; j++) {
				V[i][j] = (S[j] == 'O');
			}
		}

		int sz = 0;
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				if (!F[i][j] && V[i][j] == 0) {
					F[i][j] = ++sz;
					bst[sz] = {i, j};
					dfs(i, j, 0, 0);
				}
			}
		}

		vector<pii> K;
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				if (V[i][j] == 0) {
					K.push_back({i, j});
				}
			}
		}

		// for (int i = 1; i <= sz; i++) {
		// 	cout << bst[i].ff << ' ' << bst[i].ss << " -> ";
		// 	for (auto [x, y] : G[i]) {
		// 		cout << x << ' ' << y << "!! ";
		// 	}
		// 	cout << '\n';
		// }

		int ans = 0;
		for (auto [i, j] : K) {
			int k = F[i][j];
			int px = i - bst[k].ff;
			int py = j - bst[k].ss;

			bool flag = true;
			for (auto [x, y] : K) {
				if (i == x && j == y) continue;

				int ddx = x - px;
				int ddy = y - py;

				if (mp[k].find({ddx, ddy}) != mp[k].end()) {
					bool f = mp[k][{ddx, ddy}];
					if (f) {
						flag = false;
						break;
					}
				}
				else {
					bool yes = true;
					for (auto [z, w] : G[k]) {
						int qx = x - px + z;
						int qy = y - py + w;
						if (!in(qx, qy) || V[qx][qy] == 1) {
							yes = false;
							break;
						}
					}

					mp[k][{ddx, ddy}] = yes;
					if (yes) {
						flag = false;
						break;
					}
				}
			}
			if (flag) ++ans;
		}
		cout << ans << '\n';

		for (int i = 0; i <= sz; i++) {
			mp[i].clear();
			G[i].clear();
		}
	}
}