//#pragma GCC optimize("O2")
//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx,popK,sse4,abm")
#include <bits/stdc++.h>
//#define int long long
#define db double
#define out(x) cerr << #x << '=' << (x) << '\n'
#define out2(x, y) cerr << #x << '=' << (x) << ',' << #y << '=' << (y) << '\n'
#define sz(x) (int)x.size()
#define fr first
#define sc second
#define INF 0x3f3f3f3f
#define y1 yyyyyy
#define lowbit(x) ((x) & -(x))
#define PI (db)acos(-1.0)
#define eb emplace_back
#define pb push_back
#define PII pair<i64,i64>
#define wrong std::string::npos
using i64 =long long;
using i128=__int128;

constexpr int N=1e6+5;
constexpr db eps=1e-8;
constexpr std::array<int, 8> dx{0, 1, 0, -1, 1, 1, -1, -1};
constexpr std::array<int, 8> dy{1, 0, -1, 0, 1, -1, 1, -1};
constexpr i64 mod = 998244353;

i64 fpow(i64 x, i64 r)
{
    i64 result = 1;
    while (r)
    {
        if (r & 1)result = result * x % mod;
        r >>= 1;
        x = x * x % mod;
    }
    return result;
}

i64 fpow1(i64 x, i64 r,i64 p)
{
    i64 result = 1;
    while (r)
    {
        if (r & 1)result = result * x % p;
        r >>= 1;
        x = x * x % p;
    }
    return result;
}


i64 fpow2(i64 x, i64 r)
{
    i64 result = 1;
    while (r)
    {
        if (r & 1)result = result * x;
        r >>= 1;
        x = x * x;
    }
    return result;
}
i64 gcd(i64 a,i64 b)
{
    return b?gcd(b,a%b):a;
}


void solve()
{
    int n,m;
    std::cin>>n>>m;
    std::vector<std::string>g(n+1,"");
    for(int i=1;i<=n;i++)
    {
        std::string s;
        std::cin>>s;
        s=" "+s;
        g[i]=s;
    }
    int idx=0;
    std::vector<std::pair<int,int>>pos;
    std::vector<std::vector<int>>vis(n+1,std::vector<int>(m+1,0));
    auto bfs=[&](int x,int y) {
        std::queue<std::pair<int,int>>q;

        vis[x][y]=++idx;
        q.push({x,y});
        while (sz(q))
        {
            auto [xx,yy]=q.front();
            q.pop();
            pos.eb(xx-x,yy-y);
            for(int i=0;i<4;i++)
            {
                int nx=xx+dx[i],ny=yy+dy[i];
                if(nx<1||nx>n||ny>m||ny<1||vis[nx][ny]||g[nx][ny]=='O') continue;
                q.push({nx,ny});
                vis[nx][ny]=idx;
            }
        }
    };
    i64 res=0;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            if(vis[i][j]||g[i][j]=='O') continue;
            bool f=1;
            pos.clear();
            bfs(i,j);

            for(int r=1;r<=n&&f;r++)
            {
                for(int c=1;c<=m&&f;c++)
                {
                    if(g[r][c]=='O'||vis[r][c]==idx) continue;
                    bool ok=1;
                    for(auto [x,y]:pos)
                    {
                        int nx=r+x,ny=c+y;
                        if(nx<1||nx>n||ny<1||ny>m||g[nx][ny]=='O')
                        {
                            ok=0;
                            break;
                        }
                    }
                    if(ok) f=0;
                }
            }
            if(f) res+=sz(pos);
        }
    }

    std::cout<<res<<'\n';
}

signed main()
{
    std::ios::sync_with_stdio(0);
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);
    std::cout<<std::fixed<<std::setprecision(10);

    int _=1;
    std::cin>>_;
    while(_--) solve();

    return 0;
}