#include <bits/stdc++.h>
using namespace std;
#define int long long
using ll = long long;
using pi = pair<int, int>;
template<class... Args> void _(Args... args) {
	auto print = [&](auto x) { cout << x << " "; };
	cout << "--->";
	int arr[] = {(print(args), 0)...};
	cout << "\n";
}
struct KUAI
{
	int lon=0,hei=0,siz=0;
};

void Solve(){
	int n,m;cin>>n>>m;
	string s[n];vector<vector<int>> vis(n,vector<int>(m,0));int cnt=0;
	for(int i=0;i<n;i++)cin>>s[i];
	vector<KUAI> kuai{{-1,-1,-1}};
	auto ok=[&](int x,int y)
	{
		return ((x<n && y<m) && s[x][y]=='.');
	};
	auto bfs=[&](int x,int y)
	{
		cnt++;
		kuai.push_back({0,0,0,});
		queue<pi> pq;pq.push({x,y});
		vis[x][y]=cnt;
		int x1=LLONG_MAX,x2=-1,y1=LLONG_MAX,y2=-1;
		while(!pq.empty())
		{
			auto [xx,yy] = pq.front();pq.pop();
			//_(xx,yy);
			kuai[cnt].siz++;
			x1=min(x1,xx);x2=max(x2,xx);
			y1=min(y1,yy);y2=max(y2,yy);
			kuai[cnt].lon=max(kuai[cnt].lon,y2-y1+1);
			kuai[cnt].hei=max(kuai[cnt].hei,x2-x1+1);
			if(ok(xx+1,yy)&&vis[xx+1][yy]==0) pq.push({xx+1,yy}),vis[xx+1][yy]=cnt;
			if(ok(xx-1,yy)&&vis[xx-1][yy]==0) pq.push({xx-1,yy}),vis[xx-1][yy]=cnt;
			if(ok(xx,yy+1)&&vis[xx][yy+1]==0) pq.push({xx,yy+1}),vis[xx][yy+1]=cnt;
			if(ok(xx,yy-1)&&vis[xx][yy-1]==0) pq.push({xx,yy-1}),vis[xx][yy-1]=cnt;
		}
	};
	for(int i=0;i<n;i++)for(int j=0;j<m;j++)if(vis[i][j]==0&&s[i][j]=='.')bfs(i,j);
	int ans=0;
	for(int i=1;i<=kuai.size()-1;i++)
	{
		bool is=1;
		for(int j=1;j<=kuai.size()-1;j++)
		{
			if(i==j)continue;
			if(!(kuai[i].siz>kuai[j].siz || kuai[i].hei>kuai[j].hei || kuai[i].lon>kuai[j].lon))
			{
				is=0;
			}
		}
		if(is)ans+=kuai[i].siz;
	}
	cout<<ans<<endl;
}
signed main() {
#ifdef _LOCAL
	freopen("in.txt", "r", stdin);
	freopen("out.txt", "w", stdout);
#endif
	int Task = 1;
	cin >> Task;
	while (Task--) Solve();
}

int __OI_INIT__ = []() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cout << fixed << setprecision(12);
	return 0;
}();