#include<bits/stdc++.h>
using namespace std;
const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
vector<vector<bool>> mp;
int n,m;
bool solve(int ax,int ay,int bx,int by)
{
	vector vis(n+2,vector<bool>(m+2));
	queue<array<int,4>> q;
	q.push({ax,ay,bx,by});
	vis[ax][ay]=1;
	while(!q.empty())
	{
		auto [x,y,bx,by]=q.front(); q.pop();
		for(int i=0; i<=3; i++)
		{
			int nx=x+dx[i],ny=y+dy[i],nbx=bx+dx[i],nby=by+dy[i];
			if(vis[nx][ny]||mp[nx][ny]==0) continue;
			if(mp[nbx][nby]==0) return 1;
			q.push({nx,ny,nbx,nby});
			vis[nx][ny]=1;
		}
	}
	return 0;
}
void O_o()
{
	cin>>n>>m;
	mp.assign(n+2,vector<bool>(m+2,0));
	vector<array<int,2>> a;
	for(int i=1; i<=n; i++)
	{
		string s;
		cin>>s;
		for(int j=0; j<m; j++)
		{
			if(s[j]=='.')
			{
				mp[i][j+1]=1;
				a.push_back({i,j+1});
			}
				
		}
	}
	int ans=0;
	for(int i=0; i<a.size(); i++)
	{
		bool bz=1;
		for(auto j=0; j<a.size(); j++)
		{
			if(i==j) continue;
			if(!solve(a[i][0],a[i][1],a[j][0],a[j][1]))
			{
				bz=0;
				break;
			}
		}
		ans+=bz;
	}
	cout<<ans<<"\n";
}
signed main()
{
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	cout<<fixed<<setprecision(12);
	int T=1;
	cin>>T;
	while(T--)
	{
		O_o();
	}
}