#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define ULL unsigned long long
#define Enter putchar('\n')
#define spc putchar(' ')
#define pb push_back
#define fi first
#define se second
inline void read(int &num){num=0;int f=1;char ch=getchar();while(ch>'9'||ch<'0'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){num=(num<<1)+(num<<3)+(ch^48);ch=getchar();}num*=f;}
inline void lread(long long &num){num=0;int f=1;char ch=getchar();while(ch>'9'||ch<'0'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){num=(num<<1)+(num<<3)+(ch^48);ch=getchar();}num*=f;}
void print(long long num){if(num<0){putchar('-');num=-num;}if(num>9){print(num/10);}putchar((num%10)^48);}
char a[1009];
int f[1009];
vector<int> g[1009];
int xx[4]={1,-1,0,0},yy[4]={0,0,1,-1};
int n,m;
inline int d(int x,int y){
    return (x-1)*m+y;
}
inline bool ck1(int x,int y){
    return x>0&&x<=n&&y>0&&y<=m;
}
inline bool ck(int x){
    return x>0&&x<=n*m;
}
int find(int re){
    return f[re]==re?re:f[re]=find(f[re]);
}
int cal(int x,int y,int z,int h,int i){
    int s=z%m;
    if(s==0)s=m;
    int v=(z-1)/m+1;
    if(ck1(h+v-x,i+s-y)==0)return 0;
    return d(h+v-x,i+s-y);
}
int main(){
    int T;
    scanf("%d",&T);
    a[0]='O';
    while(T--){
        scanf("%d%d",&n,&m);
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                f[d(i,j)]=d(i,j);
                scanf(" %c",&a[d(i,j)]);
            }
        }
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                if(a[d(i,j)]=='O')continue;
                for(int k=0;k<4;k++){
                    if(ck1(i+xx[k],j+yy[k])&&a[d(i+xx[k],j+yy[k])]=='.'){
                        //cout<<find(d(i,j))<<' '<<find(d(i+xx[k],j+yy[k]))<<' '<<i<<' '<<j<<' '<<i+xx[k]<<' '<<j+yy[k]<<endl;
                        f[find(d(i,j))]=find(d(i+xx[k],j+yy[k]));
                    }
                }
            }
        }
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                if(a[d(i,j)]=='O')continue;
                g[find(d(i,j))].pb(d(i,j));
            }
        }
        // for(int i=1;i<=n;i++){
        //     for(int j=1;j<=m;j++){
        //         if(a[d(i,j)]=='O'||find(d(i,j))!=d(i,j))continue;
        //         cout<<i<<' '<<j<<' '<<d(i,j)<<':';
        //         for(int k=0;k<g[d(i,j)].size();k++){
        //             cout<<g[d(i,j)][k]<<' ';
        //         }
        //         cout<<endl;
        //     }
        // }
        int re,p,ans=0;
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                bool flag=1;
                re=d(i,j);
                if(a[re]=='O')continue;
                for(int b=1;b<=n&&flag;b++){
                    for(int c=1;c<=m;c++){
                        if(b==i&&c==j)continue;
                        bool vi=1;
                        int z=find(re);
                        //if(a[d(b,c)]!='O')cout<<i<<' '<<j<<' '<<b<<' '<<c<<' '<<z<<' '<<find(d(b,c))<<endl;
                        if(a[d(b,c)]=='O'||z==find(d(b,c)))continue;
                        //cout<<i<<' '<<j<<' '<<b<<' '<<c<<' '<<re<<endl;
                        for(int e=0;e<g[z].size();e++){
                            p=cal(i,j,g[z][e],b,c);
                            //printf("%d %d %d %d %d %d\n",i,j,g[z][e],b,c,p);
                            if(ck(p)==0||a[p]=='O'){
                                //cout<<i<<' '<<j<<':'<<b<<' '<<c<<'#'<<g[z][e]<<endl;
                                vi=0;
                                break;
                            }
                        }
                        //cout<<"Yes"<<' '<<i<<' '<<j<<' '<<vi<<endl;
                        if(vi){
                            flag=0;
                            break;
                        }
                    }
                }
                if(flag)++ans;
            }
        }   
        print(ans),Enter;     
        for(int i=1;i<=n*m;i++)g[i].clear();
    }
    return 0;
}
/*
1
2 5
.OO..
.O.O.
*/