#include<bits/stdc++.h>
#define pos(x,y) ((x-1)*m+y)
#define fail(x,y) (x<1||y<1||x>n||y>m||a[x][y]=='O')
using namespace std;

const int X[]={1,0,-1,0};
const int Y[]={0,1,0,-1};
char a[1005][1005],vis[1005][1005];
int n,m,f[1005][1005],ans;

void dfs(int xa,int ya,int xb,int yb)
{
    int p1=pos(xa,ya),p2=pos(xb,yb);
    // cerr<<xa<<' '<<ya<<' '<<xb<<' '<<yb<<':'<<p1<<' '<<p2<<' '<<f[p1][p2]<<endl;
    if(f[p1][p2]) return;
    vis[p1][p2]=1;
    for(int i=0;i<4;i++)
    {
        int px=xa+X[i],py=ya+Y[i],qx=xb+X[i],qy=yb+Y[i];
        int f1=fail(px,py),f2=fail(qx,qy);
        if(f1) continue;
        if(f2)
        {
            f[p1][p2]=1;
            continue;
        }
        // cerr<<px<<' '<<py<<' '<<qx<<' '<<qy<<endl;
        if(!vis[pos(px,py)][pos(qx,qy)]) dfs(px,py,qx,qy);
        f[p1][p2]|=f[pos(px,py)][pos(qx,qy)];
    }
    vis[p1][p2]=0;
}

void sol()
{
    cin>>n>>m;
    memset(f,0,sizeof(f));
    memset(vis,0,sizeof(vis));
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            cin>>a[i][j];
        }
    }
    ans=0;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            int res=1;
            if(a[i][j]=='O') continue;
            for(int k=1;k<=n;k++)
            {
                for(int l=1;l<=m;l++)
                {
                    if(a[k][l]=='O'||i==k&&j==l) continue;
                    dfs(i,j,k,l);
                    res&=f[pos(i,j)][pos(k,l)];
                    // cerr<<i<<','<<j<<' '<<k<<','<<l<<' '<<f[pos(i,j)][pos(k,l)]<<endl;
                }
            }
            ans+=res;
        }
    }
    cout<<ans<<endl;
}

int main()
{
    int t;
    cin>>t;
    while(t--) sol();
    return 0;
}