#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define PII pair<int,int>
#define PIIII pair<PII,PII>
const int N=1e3+100;
int n,m,ans,tmp,dx[]={0,0,1,-1},dy[]={1,-1,0,0};
char s[N][N];
map<PIIII,int> mp;
bool fail(int x,int y)
{
	if(x>n||x<1||y>m||y<1||s[x][y]!='.') return true;
	return false;
}
void dfs(int x,int y,int i,int j)
{
	mp[{{x,y},{i,j}}]=tmp;
	for(int t=0;t<4;++t)
	{
		int nx=x+dx[t],ny=y+dy[t];
		int ni=i+dx[t],nj=j+dy[t];
		if(fail(nx,ny)) continue;
		if(fail(ni,nj)) 
		{
			mp[{{x,y},{i,j}}]=2;
			return;
		} 
		if(!mp.count({{nx,ny},{ni,nj}}))
		{
		    dfs(nx,ny,ni,nj);
		    if(mp[{{nx,ny},{ni,nj}}]==2)
		    {
		        mp[{{x,y},{i,j}}]=2;
		        return;
		    }
		}
		else
		{
		    if(mp[{{nx,ny},{ni,nj}}]==2)
		    {
		        mp[{{x,y},{i,j}}]=2;
		        return;
		    }
		    else if(mp[{{nx,ny},{ni,nj}}]!=tmp)
		    {
		        dfs(nx,ny,ni,nj);
		        if(mp[{{nx,ny},{ni,nj}}]==2)
		        {
		           mp[{{x,y},{i,j}}]=2;
		           return;
		        }
		    }
		}
	}
}
void work(int x,int y)
{
	int now=0;
	tmp++;
	for(int i=1;i<=n;++i)
	{
		for(int j=1;j<=m;++j)
		{
		    if(i==x&&y==j) continue;
			if(s[i][j]=='.')
			{
				if(mp.count({{x,y},{i,j}}))
				{
					if(mp[{{x,y},{i,j}}]==2)
					now++;
					else if(mp[{{x,y},{i,j}}]==tmp) 
					{
					    return;
					}
					else
					{
					    dfs(x,y,i,j);
					    if(mp[{{x,y},{i,j}}]==2) now++;
					    else return;
					}
				}
				else
				{
					dfs(x,y,i,j);
					if(mp[{{x,y},{i,j}}]==2) now++;
					else 
					{
					    return;
					}
				}
				
			}
		}
	}
	++ans; 
}
void solve()
{
    tmp=3;
    ans=0;
	mp.clear();
	cin>>n>>m;
	for(int i=1;i<=n;++i)
	{
		for(int j=1;j<=m;++j)
		{
			cin>>s[i][j];
		}
	}
	for(int i=1;i<=n;++i)
	{
		for(int j=1;j<=m;++j)
		{
			if(s[i][j]=='.') work(i,j);
		}
	}
	cout<<ans<<endl;

}
int main()
{
	ios::sync_with_stdio(0),cin.tie(0);
	int _;cin>>_;
	while(_--) solve();
	return 0;	
}