#define _CRT_SECURE_NO_DEPRECATE
#include<iostream>
#include<algorithm>
#include<iomanip>
#include<math.h>
#include<queue>
#include<cstring>
#include<map>
#include<set>
#include<stack>
#include<unordered_map>
#include<string>
#include<time.h>
#include<bitset>
#include<deque>
using namespace std;
#define int long long
#define endl '\n'
const int N = 1e5 + 10;
int P = 998244353;
const double eps = 1e-6;
string s[N];
unordered_map<int, int>vis, flag;
int gao(int a, int b, int c, int d) {
	return a * 1005 * 1005 * 1005 + b * 1005 * 1005 + c * 1005 + d;
}
void ungao(int k, int& a, int& b, int& c, int& d) {
	a = k / 1005 / 1005 / 1005;
	k -= a * 1005 * 1005 * 1005;
	b = k / 1005 / 1005;
	k -= b * 1005 * 1005;
	c = k / 1005;
	k -= c * 1005;
	d = k;
}
int dx[4] = { 0,0,-1,1 };
int dy[4] = { 1,-1,0,0 };int n, m;
bool fail(int a, int b, int c, int d) {
	if (c<1 || c>n || d<1 || d>m || s[c][d] == 'O')return 1;
	return 0;
}

void bfs(int S) {
	int a, b, c, d;
	queue<int>hh;
	hh.push(S);
	vis[S] = S;
	while (hh.size()) {
		int now = hh.front();hh.pop();
		ungao(now, a, b, c, d);
		for (int i = 0;i < 4;i++) {
			int na = a + dx[i];
			int nc = c + dx[i];
			int nb = b + dy[i];
			int nd = d + dy[i];
			if (na<1 || nb<1 || na>n || nb>m ||s[na][nb]=='O')continue;
			int nx = gao(na, nb, nc, nd);
			if (vis.count(nx) != 0) {
				
				continue;
			}
			if (fail(na, nb, nc, nd)) {
				flag[S] = 1;
			}
			vis[nx] = S;
			hh.push(nx);
		}
	}
}
inline void solve() {

	vis.clear();flag.clear();

	cin >> n >> m;
	for (int i = 1;i <= n;i++)cin >> s[i],s[i]=" "+s[i];
	int ans = 0;
	for (int i = 1;i <= n;i++) {
		for (int j = 1;j <= m;j++) {
			if (s[i][j] == '.') {
				bool f = 1;
				for (int u = 1;u <= n;u++) {
					if (f == 0)break;
					for (int v = 1;v <= m;v++) {
						if (f == 0)break;
						if (s[u][v] == '.') {
							if (u == i && v == j)continue;
							int kk = gao(i, j, u, v);
							if (vis.count(kk) == 0) {
								bfs(kk);
								if (flag[kk] == 0)f = 0;
							}
							else {
								if (flag[vis[kk]] == 0)f = 0;
							}
						}
					}
				}
				if (f)ans++;
			}
		}
	}
	cout << ans << endl;
}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	
	int t;
	t = 1;
	cin >> t;
	while (t--) {
		solve();
	}
}