#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
void solve();
signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	int T; cin >> T;
	while (T--)solve();
	return 0;
}
int oo = 0;
void solve() {
	int n, m;
	cin >> n >> m;
	vector<string>s(n);
	vector<bool>v(n * m);
	auto get = [&](int x, int y)->int {
		return x * m + y;
	};
	for (int i = 0; i < n; i++) {
		cin >> s[i];
		for (int j = 0; j < m; j++) {
			if (s[i][j] == '.')v[get(i, j)] = 0;
			else v[get(i, j)] = 1;
		}
	}
	//return;
	vector<int>vis(n * m);
	vector<vector<int>>flag(n * m, vector<int>(n * m));
	vector<int>dx = { 0,0,-1,1 };
	vector<int>dy = { -1,1,0,0 };
	int ans = 0;
	vector<int>add(n * m + 1);
	int cnt = 0;
	auto fail = [&](int x, int y)->bool {
		if (x < 0 || x >= n || y < 0 || y >= m || v[get(x, y)] == 1 || vis[get(x, y)] == 1)return 1;
		return 0;
	};
	auto dfs = [&](auto dfs, int u, int t) ->int{
		if (flag[u][t])return flag[u][t];
		int i = u / m, j = u % m, x = t / m, y = t % m;
		int ok = -1;
		for (int k = 0; k < 4; k++) {
			int ni = dx[k] + i, nj = dy[k] + j, nx = dx[k] + x, ny = dy[k] + y;
			int nu = get(ni, nj), nt = get(nx, ny);
			if (fail(ni, nj))continue;
			if (fail(nx, ny)) {
				ok = 1;
				continue;
			}
			vis[nu] = 1;
			add[++cnt] = nu;
			//add[++cnt] = nt;
			ok = max(dfs(dfs, nu, nt), ok);
		}
		flag[u][t] = ok;
		return ok;
	};
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			int u = get(i, j);
			if (v[u] == 1)continue;
			int ok = 1;
			for (int x = 0; x < n; x++) {
				for (int y = 0; y < m; y++) {
					int t = get(x, y);
					if (v[t] == 1||u==t)continue;
					vis[u] = 1;
					add[++cnt] = u;
					flag[u][t]=dfs(dfs, u, t);
					ok = min(ok, flag[u][t]);
					for (int i = 1; i <= cnt; i++) {
						vis[add[i]] = 0;
					}
					cnt = 0;
				}
			}
			ans += (ok==1);
			//if (ok == 1)cout << i << ' ' << j << endl;
		}
	}
	cout << ans << endl;
}