#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define maxn 1008
#define put() putchar('\n')
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
using namespace std;
Tp void read(T &x){
    int f=1;x=0;char c=getchar();
    while (c<'0'||c>'9') {if (c=='-') f=-1;c=getchar();}
    while (c>='0'&&c<='9') {x=x*10+c-'0';c=getchar();}
    x*=f;
}
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
}using namespace Debug;
#define fi first
#define se second
#define mk make_pair
const int mod=1e9+7;
int power(int x,int y=mod-2) {
	int sum=1;
	while (y) {
		if (y&1) sum=sum*x%mod;
		x=x*x%mod;y>>=1;
	}
	return sum;
}
int n,m;
int tot;
int a[maxn][maxn];
vector<pair<int,int> > vis[1005];
pair<int,int>s[maxn];
int dfn[maxn][maxn],c[maxn][maxn];
int fx[5]={1,-1,0,0},fy[5]={0,0,1,-1};
queue<pair<int,int> >q;
void find(int x,int y) {
    int i,xx,yy;
    s[++tot]=mk(x,y);
    q.push(mk(x,y));dfn[x][y]=1;
    while (!q.empty()) {
        auto tmp=q.front();q.pop();
        vis[tot].push_back(mk(tmp.fi,tmp.se));
        // gdb(tot,tmp.fi,tmp.se);
        for (i=0;i<4;i++) {
            xx=tmp.fi+fx[i],yy=tmp.se+fy[i];
            if (a[xx][yy]&&!dfn[xx][yy]) dfn[xx][yy]=1,q.push(mk(xx,yy));
        }
    }
}
bool calc(int x,int y) {
    int i,j,len1=vis[x].size(),len2=vis[y].size();
    for (i=0;i<len1;i++) c[vis[x][i].fi][vis[x][i].se]=1;
    int sx=s[y].fi,sy=s[y].se;
    int ans=0;
    for (i=0;i<len1;i++) {
        int tmpx=vis[x][i].fi,tmpy=vis[x][i].se;
        int flag=1;
        for (j=0;j<len2;j++) if (c[vis[y][j].fi-sx+tmpx][vis[y][j].se-sy+tmpy]==0) flag=0;
        ans|=flag;
        if (ans) break;
    }
    for (i=0;i<len1;i++) c[vis[x][i].fi][vis[x][i].se]=0;
    return ans;
} 
void solve(void) {
    int i,j;char ch;
    read(n);read(m);tot=0;
    for (i=1;i<=n;i++) {
        ch=getchar();
        while (ch!='.'&&ch!='O') ch=getchar();
        for (j=1;j<=m;j++,ch=getchar()) a[i][j]=(ch=='.');//,gdb(i,j,a[i][j]);
    }   
    for (i=1;i<=n;i++) for (j=1;j<=m;j++) if (a[i][j]&&!dfn[i][j]) {
        find(i,j);
    }
    int ans=0;
    for (i=1;i<=tot;i++) {
        int fl=0;
        for (j=1;j<=tot;j++) if (i^j) {
            if (calc(j,i)) {fl=1;break;}
        }
        // gdb(i,vis[i].size());
        if (!fl) ans+=vis[i].size();
    }
    printf("%d\n",ans);
    for (i=1;i<=n+1;i++) for (j=1;j<=m+1;j++) a[i][j]=dfn[i][j]=0;
    for (i=1;i<=tot;i++) vis[i].clear();
}
signed main(void){
	int T;
    read(T);
    while (T--) solve();
	return 0;
}
//i=begin && g++ $i.cpp -o $i -std=c++14 -O2 && ./$i