#include<bits/stdc++.h>
using namespace std;
const int N=1e3+3;
char mp[N][N];
int dp[N][N];//-1不行
int n,m;
int encode(int x,int y){
    int val=m*(x-1)+y-1;
    return val;
}
bool inb(int x,int y){
    if(x<=0||x>n)return false;
    if(y<=0||y>m)return false;
    return true;
}
int dx[]={0,1,0,-1};
int dy[]={1,0,-1,0};
bool debugs=false;
int judge(int x,int y,int x1,int y1){
    int t0=encode(x,y),t1=encode(x1,y1);
    
    if(!inb(x,y))return -1;
    if(!inb(x1,y1)){
        if(mp[x][y]=='.')
        return 1;
        else return -1;
    }
    if(mp[x][y]=='.'&&mp[x1][y1]=='O')return dp[t0][t1]=1;
    if(mp[x][y]=='O')return dp[t0][t1]=-1;
    return 0;
}
int vis[N][N];
void dfs(int x,int y,int x1,int y1){
    //if(x==1&&y==1&&x1==1&&y1==3)debugs=true;
    //printf("%d %d %d %d\n",x,y,x1,y1);
    int t0=encode(x,y),t1=encode(x1,y1);
    if(inb(x,y)&&inb(x1,y1))
    {
        //if(x==1&&y==4&&x1==1&&y1==1)puts("hh");
        if(vis[t0][t1])return;
        vis[t0][t1]=1;
    }
    
    if(inb(x,y)&&inb(x1,y1)){
        int& val=dp[t0][t1];
        val=1;
    }
    for(int i=0;i<4;i++){
        int x2=x+dx[i],x3=x1+dx[i];
        int y2=y+dy[i],y3=y1+dy[i];
        if(!inb(x2,y2)||!inb(x3,y3))continue;
        if(mp[x2][y2]!='.')continue;
        dfs(x2,y2,x3,y3);
    }
}
int main(){
    int T;
    cin>>T;
    while(T--){
        scanf("%d%d",&n,&m);
        for(int i=1;i<=n;i++){
            scanf("%s",mp[i]+1);
        }
        for(int i=0;i<=n*m;i++){
            memset(vis[i],0,sizeof(int)*(m*n+1));
            memset(dp[i],0,sizeof(int)*(m*n+1));
        }
        int ans=0;
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                bool flag=true;
                for(int x=0;x<=n+1;x++){
                    for(int y=0;y<=m+1;y++){
                        if(x==i&&j==y)continue;
                        if(judge(i,j,x,y)==1)
                        {dfs(i,j,x,y);
                    //puts("");
                   }
                        //if(dp[encode(i,j)][encode(x,y)]==-1)flag=false;
                    }
                }
            }
        }
        
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                bool flag=true;
                for(int x=1;x<=n;x++){
                    if(flag)
                    for(int y=1;y<=m;y++){
                        if(x==i&&j==y)continue;
                        if(dp[encode(i,j)][encode(x,y)]!=1){
                            //printf("====%d %d %d %d\n",i,j,x,y);
                            flag=false;break;
                        }
                    }
                }
                if(n==1&&m==1){
                    if(mp[n][m]=='.')ans++;
                }
                else if(flag){ans++;}
            }
        }
        cout<<ans<<endl;
    }
    return 0;
}