#include<stdio.h>
#include<iostream>
#include<queue>
#include<algorithm>
#include<bitset>
#include<map>
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
typedef long long ll;
typedef pair<int,int> Pii;
const int maxn = 1e3+10;

const int N = 4000;
bitset<N> a[2][maxn];

int cnt=0;
map<Pii,int> lib;

int fa[maxn*maxn],rnk[maxn*maxn];
vector<int> Set[maxn*maxn];
void Init(int n,int m){
    rep(i,0,n*m-1) rnk[i]=0,fa[i]=i;
}
int Find(int x){
    if(fa[x]==x) return x;
    else return fa[x]=Find(fa[x]);
}
void Union(int x,int y){
    x=Find(x),y=Find(y);
    if(x==y) return;
    if(rnk[x]<rnk[y]) swap(x,y);
    else if(rnk[x]==rnk[y]) rnk[x]++;
    fa[y]=x;
}



char s[maxn][maxn];
vector<int> krgIdx;

int main(){
    int _;  cin>>_;
    while(_--){
        int n,m;    scanf("%d%d",&n,&m);
        rep(i,0,n-1) scanf("%s",s[i]);
        Init(n,m);

        krgIdx.clear();
        rep(i,0,n-1) rep(j,0,m-1){
            if(s[i][j]=='O') continue;
            krgIdx.push_back(i*m+j);
            int id=i*m+j;
            if(i>0&&s[i-1][j]=='.') Union(id,id-m);
            if(j>0&&s[i][j-1]=='.') Union(id,id-1);
        }

        if(krgIdx.empty()){
            puts("0");
            continue;
        }

        rep(i,0,n*m-1) Set[Find(i)].push_back(i);
        lib.clear();
        lib[{0,0}]=cnt=0;

        rep(i,0,n*m-1) a[0][i].reset(),a[1][i].reset();

        //生存向量
        rep(i,0,n*m-1){
            if(s[i/m][i%m]=='O') continue;
            if(Find(i)==i){
                int sz=Set[i].size();
                rep(j0,0,sz-1){
                    int j=Set[i][j0];
                    int r1=Set[i][j0]/m,c1=Set[i][j0]%m;
                    a[0][j][0]=1;

                    rep(k0,j0+1,sz-1){
                        int k=Set[i][k0];
                        int r2=Set[i][k0]/m,c2=Set[i][k0]%m;
                        int& idx1=lib[{r2-r1,c2-c1}];
                        if(idx1==0) idx1=++cnt;
                        a[0][j][idx1]=1;

                        int& idx2=lib[{r1-r2,c1-c2}];
                        if(idx2==0) idx2=++cnt;
                        a[0][k][idx2]=1;
                    }
                }
                Set[i].clear(); //清空
            }
        }

        //死亡向量
        rep(i,1-n,n-1) rep(j,1-m,m-1){
            rep(k,0,n*m-1){
                int r=k/m,c=k%m;
                int& idx=lib[{i,j}];
                if(idx==0) idx=++cnt;

                if(r+i<0||r+i>n-1||c+j<0||c+j>m-1||s[r+i][c+j]=='O'){
                    a[1][k][idx]=1;
                }
            }
        }

        int ans=0;
        rep(i,0,n-1) rep(j,0,m-1){
            if(s[i][j]=='O') continue;
            int id=i*m+j;
            bool flag=true;
            for(auto& e:krgIdx){
                if(e==id) continue;
                if(!(a[0][id]&a[1][e]).any()) {
                    flag=false;break;
                }
            }
            if(flag) 
                ans++;
        }
        cout<<ans<<endl;
    }

    fflush(stdin); 
    getchar();
}
/*

*/