#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
ull f[2005][2005];
vector<pair<int, int>> dir = {
	{1, 0},
	{-1, 0},
	{0, -1},
	{0, 1}
};


void solve()
{
	int n, m;
	cin >> n >> m;
	vector a(n + 2, vector<char>(m + 2, 'O'));
	int tot = 0;
	for(int i = 1; i <= n; ++i)
		for(int j = 1; j <= m; ++j) {
			cin >> a[i][j];
			tot += a[i][j] == '.';
		}


	vector val(n + 2, vector<set<pair<int, int>>>(m + 2));
	auto bfs = [&](int x, int y)  {
		queue<pair<int, int>> q;
		vector vis(n + 2, vector<int>(m + 2));
		vis[x][y] = 1;
		q.emplace(0, 0);
		while(!q.empty()) {
			auto [dx, dy] = q.front();
			val[x][y].emplace(dx, dy);
			q.pop();

			for(auto &[ddx, ddy] : dir) {
				int sx = x + dx + ddx, sy = y + dy + ddy;
				if(vis[sx][sy] || a[sx][sy] == 'O')
					continue;
				vis[sx][sy] = 1;
				q.emplace(dx + ddx, dy + ddy);
			}
		}

	};

	for(int i = 1; i <= n; ++i)
		for(int j = 1; j <= m; ++j)
			if(a[i][j] == '.')
				bfs(i, j);


	auto ok = [&](int x, int y) {
		int cnt = 0;
		// cerr << val[1][4].size() << ' ';
		for(int i = 1; i <= n; ++i)
			for(int j = 1; j <= m; ++j)
				if(a[i][j] == '.') {
					auto A(val[x][y]), B(val[i][j]);
					A.merge(B);
					cnt += A.size() != val[i][j].size();
				}
		// cerr << cnt << ' ';
		return cnt == tot - 1;
	};

	int ans = 0;
	for(int i = 1; i <= n; ++i)
		for(int j = 1; j <= m; ++j)
			if(a[i][j] == '.')
				ans += ok(i, j);
	cout << ans << '\n';

}

signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int T = 1;
	cin >> T;
	while(T--)
		solve();
	return 0;
}