#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int>PII;
int dx[4]={0,1,-1,0},dy[4]={1,0,0,-1};
void solve()
{
	int n,m;
	cin>>n>>m;
	vector<vector<char>>g(n,vector<char>(m));
	vector<PII>a;
	for(int i=0;i<n;i++)
		for(int j=0;j<m;j++)
		{
			cin>>g[i][j];
			if(g[i][j]=='.') a.push_back({i,j});
		}
	auto bfs=[&](PII &t1,PII &t2)->bool
	{
		auto [x1,y1]=t1;
		auto [x2,y2]=t2;
		queue<PII>q;
		vector<vector<int>>vis(n,vector<int>(m));
		q.push({x1,y1});
		vis[x1][y1]=1;
		while(q.size())
		{
			auto [x,y]=q.front();q.pop();
			int nx=x-x1,ny=y-y1;
			if(nx+x2<0||nx+x2>=n||ny+y2<0||ny+y2>=m||g[nx+x2][ny+y2]=='O') return 1;
			for(int i=0;i<4;i++)
			{
				int tx=x+dx[i],ty=y+dy[i];
				if(tx<0||tx>=n||ty<0||ty>=m) continue;
				if(g[tx][ty]=='O'||vis[tx][ty]) continue;
				q.push({tx,ty});
				vis[tx][ty]=1;
			}
		}
		return 0;
	};
	int cnt=a.size();
	int res=0;
	for(int i=0;i<cnt;i++)
	{
		int flag=1;
		for(int j=0;j<cnt;j++)
		{
			if(i==j) continue;
			if(!bfs(a[i],a[j]))
			{
				flag=0;
				break;
			}
		}
		res+=flag;
	}
	cout<<res<<endl;
}
int main()
{
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int t=1;
	cin>>t;
	while(t--) 
		solve();
	return 0;
}