#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define mk make_pair
#define lowbit(x) (x&(-x))
#define pb emplace_back
#define pr pair<int,int>
#define let const auto
#define all(A) A.begin(),A.end()
void chkmin(int &x,int y){x=min(x,y);}
void chkmax(int &x,int y){x=max(x,y);}
const int N=1005,M=5e3+5;
int read(){
	int x=0,f=1; char c=getchar();
	while(('0'>c||c>'9')&&c!='-') c=getchar();
	if(c=='-') f=0,c=getchar();
	while('0'<=c&&c<='9') x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return f?x:-x;
}
char s[N][N];
int n,m;
int bl[N][N];
vector <pr> init[M];
bool chk(int x,int y){return 1<=x&&x<=n&&1<=y&&y<=m&&s[x][y]!='O';}
int id(int x,int y){return (x-1)*m+y;}
pr decode(int p){p--;return make_pair(p/m+1,p%m+1);}
const int dx[]={-1,0,1,0},dy[]={0,-1,0,1};
void dfs(int x,int y,const int p){
	bl[x][y]=p;
	init[p].emplace_back(x,y);
	for(int i=0; i<4; i++){
		int nx=x+dx[i],ny=y+dy[i];
		if(chk(nx,ny)&&!bl[nx][ny]) dfs(nx,ny,p);
	}
}
void solve(){
	n=read(),m=read();
	for(int i=1; i<=n; i++) scanf("%s",s[i]+1);
	vector <int> cur;
	for(int i=1; i<=n; i++)
		for(int j=1; j<=m; j++) if(chk(i,j)&&!bl[i][j]) dfs(i,j,id(i,j)),cur.push_back(id(i,j));
	vector <int> f(n*m+1,1);
	for(auto i:cur){
		int x,y; tie(x,y)=decode(i);
		for(int j=1; j<=n; j++)
			for(int k=1; k<=m; k++) if(chk(j,k)&&bl[j][k]!=i){
				auto ck = [&](){
					for(auto &[X,Y]:init[i])
						if(!chk(j+X-x,k+Y-y)||bl[j+X-x][k+Y-y]!=bl[j][k]) return 1;
					return 0;
				};
				if(!ck()) f[i]=0;
			}
	}
	int ans=0;
	for(int i=1; i<=n; i++)
		for(int j=1; j<=m; j++) if(chk(i,j)) ans+=f[bl[i][j]],bl[i][j]=0;
	for(int i=1; i<=n*m; i++) init[i].clear();
	printf("%d\n",ans);
}
int main(){
	int T=read();
	while(T--) solve();
	return 0;
}