#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define OPFI(x) freopen(#x".in", "r", stdin);\
                freopen(#x".out", "w", stdout)
#define REP(i, a, b) for(int i=(a); i<=(b); ++i)
#define REPd(i, a, b) for(int i=(a); i>=(b); --i)
inline ll rd(){
    ll r=0, k=1; char c; while(!isdigit(c=getchar())) if(c=='-') k=-k;
    while(isdigit(c)) r=r*10+c-'0', c=getchar(); return r*k;
}
constexpr int N=2e3+10;
ll t, n, m, ans, sum;
char c[N];
char tt[N];
ll s[N];
bool vis[N][N];
void bfs(int x){
    queue<pair<int, int>> q;
    REP(i, 1, n*m) if(c[i]=='O') q.emplace(x, i), vis[x][i]=1;
    while(!q.empty()){
        auto [a, b]=q.front(); q.pop();
        if(a>m&&b>m){
            int u=a-m, v=b-m;
            if(!vis[u][v])
                if(c[u]=='.'&&c[v]=='.')
                    vis[u][v]=1, ++s[u], q.emplace(u, v);
        }
        if(a+m<=n*m&&b+m<=n*m){
            int u=a+m, v=b+m;
            if(!vis[u][v])
                if(c[u]=='.'&&c[v]=='.')
                    vis[u][v]=1, ++s[u], q.emplace(u, v);
        }
        if(a%m!=0&&b%m!=0){
            int u=a+1, v=b+1;
            if(!vis[u][v])
                if(c[u]=='.'&&c[v]=='.')
                    vis[u][v]=1, ++s[u], q.emplace(u, v);
        }
        if(a%m!=1&&b%m!=1){
            int u=a-1, v=b-1;
            if(!vis[u][v])
                if(c[u]=='.'&&c[v]=='.')
                    vis[u][v]=1, ++s[u], q.emplace(u, v);
        }
    }
}
int main(){
    t=rd();
    while(t--){
        n=rd(), m=rd(), ans=0, sum=0;
        REP(i, 1, (n+2)*(m+2)) c[i]=0;
        REP(i, 1, n){
            scanf("%s", tt+1);
            REP(j, 1, m) c[j+1+i*(m+2)]=tt[j];
        }
        n+=2, m+=2;
        REP(i, 1, n*m) if(c[i]!='O'&&c[i]!='.') c[i]='O';
        REP(i, 1, n*m) sum+=(c[i]=='.'), s[i]=0;
        REP(i, 1, n*m) REP(j, 1, n*m) vis[i][j]=0;
        REP(i, 1, n*m){
            if(c[i]=='.'){
                bfs(i);
            }
        }
        REP(i, 1, n*m) if(c[i]=='.') if(s[i]==sum-1){
            // cerr<<"*"<<i<<endl;
            ++ans;
        }
        printf("%lld\n", ans);
    }
    return 0;
}