#include<bits/stdc++.h>
using namespace std;

int t,n,m,dp[1010][1010];
int mp[1010][1010];

void find(int x,int y){
	if (x>m && y>m && dp[x-m][y-m]==-1){
		dp[x-m][y-m]=1;
		find(x-m,y-m);
	}
	if (x<=m*(n-1) && y<=m*(n-1) && dp[x+m][y+m]==-1){
		dp[x+m][y+m]=1;
		find(x+n,y+m);
	}
	if (x%m!=1 && y%m!=1 && dp[x-1][y-1]==-1){
		dp[x-1][y-1]=1;
		find(x-1,y-1);
	}
	if (x%m!=0 && y%m!=0 && dp[x+1][y+1]==-1){
		dp[x+1][y+1]=1;
		find(x+1,y+1);
	}
	return;
}

int main(){
	scanf("%d",&t);
	while(t--){
		scanf("%d %d",&n,&m);
		for (int i=1;i<=n;i++){
			for (int j=1;j<=m;j++){
				char c;
				scanf("%c",&c);
				if (c=='\n'){
					j--;
					continue;
				}
				if (c=='.') mp[i][j]=1;
				if (c=='O') mp[i][j]=0;
			}
		}
		for (int i=1;i<=n*m;i++){
			for (int j=1;j<=n*m;j++){
				if (mp[(i-1)/m+1][(i-1)%m+1]==0) dp[i][j]=0;
				else if (mp[(j-1)/m+1][(j-1)%m+1]==0) dp[i][j]=1;
				else dp[i][j]=-1;
				if (i==j) dp[i][j]=1;
			}
		}
		for (int i=1;i<=n*m;i++){
			for (int j=1;j<=n*m;j++){
				if (dp[i][j]!=-1) continue;
				if (i>m && mp[(i-1)/m][(i-1)%m+1]!=0 && j<=m) dp[i][j]=1;
				if (i<=m*(n-1) && mp[(i-1)/m+2][(i-1)%m+1]!=0 && j>m*(n-1)) dp[i][j]=1;
				if (i%m!=1 && mp[(i-1)/m+1][(i-1)%m]!=0 && j%m==1) dp[i][j]=1;
				if (i%m!=0 && mp[(i-1)/m+1][(i-1)%m+2]!=0 && j%m==0) dp[i][j]=1;
			}
		}
		for (int i=1;i<=n*m;i++){
			for (int j=1;j<=n*m;j++){
				if (dp[i][j]==1) find(i,j);
			}
		}
		int cnt=0;
		for (int i=1;i<=n*m;i++){
			if (mp[(i-1)/m+1][(i-1)%m+1]==0) continue;
			int p=1;
			for (int j=1;j<=n*m;j++){
				if (dp[i][j]==-1){
					p=0;
					break;
				}
			}
			if (p) cnt++;
		}
		printf("%d\n",cnt);
	}
}