// #pragma GCC optimize(3)
#include <bits/stdc++.h>
using namespace std;
const int N = 1010;
#define endl '\n'
#define int long long
typedef pair<int,int> PII;
PII p[N];
char g[N][N];
bool st[N][N];
int cnt;
int id[N][N];
vector<PII> blk[N * N]; 
bool vis[N];
int dx[] = {-1,1,0,0},dy[] = {0,0,-1,1};
int n,m;
int sz[N * N];

void dfs(int x,int y)
{
    for(int k = 0;k < 4;k++)
    {
        int xx  = dx[k] + x,yy = dy[k] + y;
        if(xx < 1 || xx > n || yy < 1 || yy > m)continue;
        if(st[xx][yy])continue;
        if(g[xx][yy] == 'O')continue;
        st[xx][yy] = true;
        blk[cnt].push_back({xx,yy});
        id[xx][yy] = cnt;
        sz[cnt]++;
        dfs(xx,yy);
    }
}


void solve()
{
    cin >> n >> m;
    cnt = 0;
    
    for(int i = 1;i <=n * m;i++)sz[i] = 0;
    for(int i =1 ;i <= n;i++)
    {
        cin >> g[i] + 1;
    }
    for(int i = 1;i <= n;i++)
    {
        for(int j =1;j <= m;j++)
        {
            if(!st[i][j] && g[i][j] != 'O')
            {
                st[i][j] = true;
                blk[++cnt].push_back({i,j});
                id[i][j] = cnt;
                sz[cnt] = 1;
                dfs(i,j);
            }
        }
    }
    // for(int i = 1;i <= n;i++)
    // {
    //     for(int j = 1;j <= m;j++)cout << id[i][j] << " ";
    //     cout << endl;
    // }
    for(int i = 1;i <= cnt;i++)vis[i] = 1;
    for(int i = 1;i <= cnt;i++)
    {
        for(int j =1;j < i;j++)
        {
            int a = i,b = j;
            if(!vis[a] && !vis[b])continue;
            if(sz[a] < sz[b])swap(a,b);
            if(sz[a] == sz[b])
            {
                bool ok = false;
                for(auto t : blk[a])
                {
                    int ax = t.first, ay = t.second;
                    auto s = blk[b][0];
                    bool flag = false;
                    int dx = ax - s.first,dy = ay - s.second;
                    for(auto tt : blk[b])
                    {
                        int bx = tt.first + dx,by = tt.second + dy;
                        if(id[bx][by] != a)
                        {
                            flag = true;
                            break;
                        }
                    }
                    if(!flag)ok = true;
                    if(ok)break;
                }
                if(ok)vis[a] = vis[b] = 0;
            }
            else 
            {
                // cout << "nnow" << a <<" " << b << endl;
                bool ok = false;
                for(auto t : blk[a])
                {
                    int ax = t.first, ay = t.second;
                    auto s = blk[b][0];
                    bool flag = false;
                    int dx = ax - s.first,dy = ay - s.second;
                    // cout << b << endl;
                    for(auto tt : blk[b])
                    {
                        int bx = tt.first + dx,by = tt.second + dy;
                        // cout << "here"<< tt.first <<" " << tt.second << endl;
                        // cout << bx <<" " << by << endl;
                        // cout << ax <<" " << ay << endl;
                        if(id[bx][by] != a )
                        {
                            flag = true;
                            break;
                        }
                    }
                    if(!flag)ok = true;
                    if(ok)break;
                }
                if(ok)
                {
                    // cout << "ok";
                    // cout << a <<" " << b << endl;
                    vis[b] = 0;
                }
            }
        }
    }
    for(int i = 1;i <= n;i++)for(int j = 1;j <= m;j++)st[i][j] = 0,id[i][j] = 0;
    for(int i = 1;i <= cnt;i++)blk[i].clear();
    if(cnt == 1)
    {
        cout << sz[cnt] << endl;return;
    }
    else if(!cnt)
    {
        cout << 0 << endl;return;
    }
    int res = 0;
    // cout << "now";
    for(int i = 1;i <= cnt;i++)
    {
        if(vis[i])res += sz[i];
        // if(vis[i])cout << i <<" ";
    }
    // cout << endl;
    
    cout << res << endl;
    
}


signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    int T;cin >> T;
    while(T--)
    solve();
}