#include<bits/stdc++.h>
#define rep(a,b,c) for(int c(a);c<=(b);++c)
using namespace std;
inline int read() {
    int res=0;char ch=getchar();while(ch<'0'||ch>'9')ch=getchar();
    while(ch<='9'&&ch>='0')res=res*10+(ch^48),ch=getchar();return res;
}
inline bool rd() {
    char ch=getchar();while(ch!='.'&&ch!='O')ch=getchar();
    return ch=='.';
}
const int N=1010,dx[4]={0,0,1,-1},dy[4]={1,-1,0,0};
int n,m,I,J;bool a[N][N],vis[N][N];
typedef pair<int,int> pii;
map<pii,int> t;
inline bool check(int x,int y) {
    if(x<1||y<1||x>n||y>m)return false;
    return a[x][y];
}
inline void dfs0(int x,int y) {
    if(!check(x,y)||vis[x][y])return;
    ++t[{x-I,y-J}];vis[x][y]=true;
    rep(0,3,i) {
        int tx=x+dx[i],ty=y+dy[i];
        dfs0(tx,ty);
    }
}
bool flag;
inline void dfs1(int x,int y) {
    if(!check(x,y)||vis[x][y])return;
    if(t[{x-I,y-J}]==1) {
        flag=true;
        return;
    }
    vis[x][y]=true;
    rep(0,3,i) {
        int tx=x+dx[i],ty=y+dy[i];
        dfs1(tx,ty);if(flag)break;
    }
}
inline void Solve() {
    n=read();m=read();
    rep(1,n,i)rep(1,m,j)a[i][j]=rd();
    t.clear();
    rep(1,n,i)rep(1,m,j)if(a[i][j]) {
        rep(1,n,ii)rep(1,m,jj)vis[ii][jj]=false;
        I=i;J=j;dfs0(i,j);
    }
    int ans=0;
    rep(1,n,i)rep(1,m,j)if(a[i][j]) {
        rep(1,n,ii)rep(1,m,jj)vis[ii][jj]=false;
        I=i;J=j;flag=false;dfs1(i,j);if(flag)++ans;
    }
    printf("%d\n",ans);
}
int main() {
    int T=read();
    while(T--)Solve();
    return 0;
}