#include <iostream>
using namespace std;
#include <set>
#include <algorithm>
#include <cmath>
#include <map>
#include <cstdio>
#include <string>
#include <cstring>
#include <string.h>
#include <stdlib.h>
#include <iomanip>
#include <fstream>
#include <stdio.h>
#include <stack>
#include <queue>
#include <ctype.h>
#include <vector>
// #include <random>
#define ll long long
#define ull unsigned long long
#define pb push_back
#define rep(i, a, n) for (int i = a; i <= n; i++)
#define per(i, a, n) for (int i = n; i >= a; i--)
#define pii pair<int, int>
#define pli pair<ll, int>
#define pil pair<int, ll>
#define pll pair<ll, ll>
#define endl '\n'
// const double pai = acos(-1);
ll extend_gcd(ll a, ll b, ll &x, ll &y)
{
    if (b == 0)
    {
        x = 1;
        y = 0;
        return a;
    }
    ll d = extend_gcd(b, a % b, y, x);
    y -= a / b * x;
    return d;
}
ll fastpow(ll a, ll n, ll mod)
{
    ll ans = 1;
    a %= mod;
    while (n)
    {
        if (n & 1)
            ans = (ans * a) % mod; //% mod
        a = (a * a) % mod;         //% mod
        n >>= 1;
    }
    return ans;
}
// inline void write(__int128 x)
// {
//     if (x > 9)
//     {
//         write(x / 10);
//     }
//     putchar(x % 10 + '0');
// }
int dir[4][2] =
    {
        {-1, 0}, {0, 1}, {1, 0}, {0, -1}}; // d a w s

const ll inf = 1000000000000000000ll;
const ll mod1 = 1e9 + 7ll, P1 = 131, mod2 = 1e9 + 11ll, P2 = 13331;
const double eps = 1e-7;
const int N = 1e3 + 10, M = 3e7 + 10;

int tt,n,m;
string s[N];

int vis[M];
bool flag[M];

int get(int a,int b,int c,int d)
{
    return a*(m+3)*(n+3)*(m+3)+b*(n+3)*(m+3)+c*(m+3)+d;
}

void unget(int u,int &a,int &b,int &c,int &d)
{
    d=u%(m+3);
    u/=(m+3);

    c=u%(n+3);
    u/=(n+3);

    b=u%(m+3);
    u/=(m+3);

    a=u;

}

void bfs(int u)
{
    int hang1,lie1,hang2,lie2;
    unget(u,hang1,lie1,hang2,lie2);

    queue<int > q;
    q.push(u);
    //
    //cout<<hang1<<" "<<lie1<<" "<<hang2<<" "<<lie2<<endl;
    //
    while (q.size())
    {
        int zhi=q.front();
        q.pop();
        unget(zhi,hang1,lie1,hang2,lie2);
        //
        //cout<<hang1<<" "<<lie1<<" "<<hang2<<" "<<lie2<<endl;
        //
 
        if(hang1<1||hang1>n||lie1<1||lie1>m||s[hang1][lie1]=='O')
        {
            continue;
        }

        
       

        if(hang2<1||hang2>n||lie2<1||lie2>m||s[hang2][lie2]=='O')//win
        {
            flag[u]=1;
           
            continue;
        }
        //
        //cout<<hang1<<" "<<lie1<<" "<<hang2<<" "<<lie2<<endl;
        //

        if(vis[zhi])
        {
            continue;
        }
        vis[zhi]=u;
        rep(i,0,3)
        {
            int temp=get(  hang1+dir[i][0],lie1+dir[i][1],hang2+dir[i][0],lie2+dir[i][1]);
            //
            //cout<<"q "<<hang1+dir[i][0]<<" "<<lie1+dir[i][1]<<" "<<hang2+dir[i][0]<<" "<<lie2+dir[i][1]<<endl;
            //
            q.push(temp);
        }

    }
    


}



int main()
{
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    //freopen("ain.txt", "r", stdin); freopen("aout.txt", "w", stdout);







    
    cin>>tt;
    while (tt--)
    {
        int ans=0;
        cin>>n>>m;
        rep(i,1,n)
        {
            cin>>s[i];
            s[i]=' '+s[i];
        }
        rep(i,0,(n+3)*(m+3)*(n+3)*(m+3))
        {
            vis[i]=flag[i]=0;
        }
        rep(i,1,n)
        {
            rep(j,1,m)
            {
                if(s[i][j]=='O')
                {
                    continue;
                }
                bool flagg=1;
                rep(ii,1,n)
                {
                    rep(jj,1,m)
                    {
                        if(ii==i&&jj==j||s[ii][jj]=='O')
                        {
                            continue;
                        }
                        int temp=get(i,j,ii,jj);
                        //
                        //cout<<"wai"<<i<<" "<<j<<" "<<ii<<" "<<jj<<" "<<temp<<endl;
                        if(vis[temp]==0)
                        {
                            bfs(temp);
                        }
                        if(flag[vis[temp]]==0)
                        {
                            flagg=0;
                            //
                            //cout<<i<<" "<<j<<"            "<<ii<<" "<<jj<<endl;
                            goto t1;
                        }

                    }
                }
                t1:
                if(flagg)
                {
                    //
                    //cout<<i<<" "<<j<<endl;
                    ans++;
                }
            }
        }
        cout<<ans<<endl;

    }
    
    



    return 0;
}