#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int>pii;
typedef pair<pii,pii>node;
const int maxn=1e3+10;
const int dx[5]={0,0,0,1,-1};
const int dy[5]={0,1,-1,0,0};
int n,m,cnt[maxn][maxn];
char s[maxn][maxn];
map<node,bool>f;
queue<node>q;
inline bool inside(int x,int y){return 1<=x&&x<=n&&1<=y&&y<=m;}
inline void solve()
{
    cin>>n>>m;
    for(int i=1;i<=n;i++) cin>>(s[i]+1);
    for(int x=1;x<=n;x++) for(int y=1;y<=m;y++) if(s[x][y]=='.')
        for(int i=0;i<=n+1;i++) for(int j=0;j<=m+1;j++) if(!inside(i,j) || s[i][j]=='O')
            f[node(pii(x,y),pii(i,j))]=true,q.push(node(pii(x,y),pii(i,j)));
    
    while(!q.empty())
    {
        pii ij=q.front().first,xy=q.front().second;q.pop();
        int i=ij.first,j=ij.second,x=xy.first,y=xy.second;
        for(int d=1;d<=4;d++)
        {
            node nxt=node(pii(i+dx[d],j+dy[d]),pii(x+dx[d],y+dy[d]));
            if(inside(i+dx[d],j+dy[d])  && inside(x+dx[d],y+dy[d]) && s[i+dx[d]][j+dy[d]]=='.')
                if(f.find(nxt)==f.end()) f[nxt]=true,q.push(nxt);
        }
    }
    int ans=0;
    for(auto [Node,flag]:f)
    {
        pii ij=Node.first,xy=Node.second;
        int i=ij.first,j=ij.second,x=xy.first,y=xy.second;
        if(flag && inside(x,y)) cnt[i][j]++;
    }
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
            if(cnt[i][j]==n*m-1)
                ans++;
    cout<<ans<<'\n';
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
            cnt[i][j]=0;
    f.clear();
}
signed main()
{
    ios::sync_with_stdio(false);cin.tie(NULL);
    int T;cin>>T;while(T--)solve();
}