#include<bits/stdc++.h>
#define ll long long
#define ssz(x) ((int)x.size())
using namespace std;
const int N=1e3+5;
int n,m;
inline int red(){
	int data=0;bool w=0;char ch=getchar();
	while(ch!='-' && (ch<'0' || ch>'9'))ch=getchar();
	if(ch=='-') w=1,ch=getchar();
	while(ch>='0' && ch<='9') data=(data<<3)+(data<<1)+ch-'0',ch=getchar();
	return w?-data:data;
}
char s[N][N];
int id=0;
typedef pair<int,int>T;
vector<T>c[N];
int vis[N][N];
queue<T>q;
int dx[]={0,0,1,-1};
int dy[]={1,-1,0,0};
void bfs(int sx,int sy,int id){
	vis[sx][sy]=id;
	q.push(T(sx,sy));
	while(!q.empty()){
		auto [x,y]=q.front();q.pop();
		c[id].push_back(T(x,y));
		for(int i=0;i<4;i++){
			int nx=x+dx[i];
			int ny=y+dy[i];
			if(nx<1||nx>n||ny<1||ny>m)continue;
			if(s[nx][ny]!='.'||vis[nx][ny])continue;
			vis[nx][ny]=id;
			q.push(T(nx,ny));
		}
	}
}
int check(int x,int y){
	if(x<1||x>n)return 0;
	if(y<1||y>m)return 0;
	return s[x][y]=='.';
}
int solve(int id,int sx1,int sy1){
	auto [sx2,sy2]=c[id][0];
	bool flag=1;
	for(auto [x,y]:c[id]){
		if(!check(x+sx1-sx2,y+sy1-sy2)){
			flag=0;
			break;
		}
	}
	return flag;
}
vector<vector<int> >ok[N];
int check(int lsr,int x,int y){
	if(x<1||x>n||y<1||y>m)return 0;
	return ok[lsr][x][y];
}
void solve(){
	id=0;
	n=red();m=red();
	for(int i=1;i<=n;i++)
		scanf("%s",s[i]+1);
	for(int i=0;i<=n+1;i++)
		s[i][0]=s[i][m+1]='0';
	for(int i=0;i<=m+1;i++)
		s[0][i]=s[n+1][i]='0';
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
			vis[i][j]=0;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
			if(!vis[i][j] && s[i][j]=='.')
				++id,bfs(i,j,id);
	//cout<<vis[1][3]<<" vis\n";
	for(int lsr=1;lsr<=id;lsr++){
		ok[lsr].resize(n+1);
		for(int i=1;i<=n;i++)
			ok[lsr][i].resize(m+1);
		for(int i=1;i<=n;i++)
			for(int j=1;j<=m;j++)
				ok[lsr][i][j]=solve(lsr,i,j);
	}
	//puts("lsr");,cout<<lsr<<" "<<i<<" "<<j<<":"<<ok[lsr][i][j]<<"\n"
	int ans=0;
	
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)if(s[i][j]=='.'){
			bool flag=1;
			for(int x=1;x<=n;x++)
				for(int y=1;y<=m;y++)
					if(s[x][y]=='.'&&(x!=i||y!=j)){
						
						//printf("%d %d %d %d %d:%d\n",i,j,vis[i][j],x+c[vis[i][j]][0].first-i,y+c[vis[i][j]][0].second-j,check(vis[i][j],x+c[vis[i][j]][0].first-i,y+c[vis[i][j]][0].second-j));
						flag&=(1-check(vis[i][j],x+c[vis[i][j]][0].first-i,y+c[vis[i][j]][0].second-j));
					}
						
			ans+=flag;
		}
	cout<<ans<<"\n";
	for(int i=1;i<=id;i++)c[i].clear();
}
int main()
{
	//ios::sync_with_stdio(false);
	//cin.tie(0);
	//cout.tie(0); 
	int T=red();
	while(T--)solve();
	return 0;
}
/*
  10
  3 2
  ..
  ..
  ..
  
 */