#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <tuple>
#include <queue>
#include <numeric>
#include <set>
#include <map>
#include <random>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define piii pair<int, pii>
#define plll pair<long long, pll>
#define tiii array<int, 3>
#define tiiii array<int, 4>
#define ff first
#define ss second
#define ee ss.ff
#define rr ss.ss
typedef long long ll;
const int INF = (int)1e9 + 7;

using namespace std;

int n, m;
bool A[1010][1010];
int cnt[2020][2020];
vector<vector<pii>> ls;

void dfs(int x, int y, vector<pii> &V)
{
	A[x][y] = false;
	V.push_back({x, y});
	for(int t = 0; t < 4; ++t)
	{
		int nx = x + "1102"[t] - '1';
		int ny = y + "0211"[t] - '1';
		if(nx >= 0 && ny >= 0 && nx < n && ny < m && A[nx][ny]) dfs(nx, ny, V);
	}
}

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

	int T; cin >> T;
	while(T--)
	{
		cin >> n >> m;
		for(int i = 0; i < n; ++i)
		{
			for(int j = 0; j < m; ++j)
			{
				char c; cin >> c;
				A[i][j] = (c == '.');
			}
		}
		ls.clear();

		for(int i = 0; i < n; ++i)
		{
			for(int j = 0; j < m; ++j) if(A[i][j])
			{
				ls.emplace_back();
				dfs(i, j, ls.back());
			}
		}

		// for(auto i : ls)
		// {
		// 	for(auto j : i) cout << "(" << j.ff << ", " << j.ss << ") ";
		// 		cout << endl;
		// }

		int ans = 0;
		for(int i = 0; i < (int)ls.size(); ++i)
		{
			bool flag = true;
			for(int j = 0; j < (int)ls.size(); ++j) if(i != j)
			{
				int mx = 0;
				for(auto [a, b] : ls[i]) for(auto [c, d] : ls[j]) mx = max(mx, ++cnt[a - c + n][b - d + m]);
				for(auto [a, b] : ls[i]) for(auto [c, d] : ls[j]) --cnt[a - c + n][b - d + m];
				if(mx == (int)ls[i].size())
				{
					flag = false;
					break;
				}
			}

			if(flag) ans += ls[i].size();
		}

		cout << ans << '\n';
	}
}