#include <bits/stdc++.h>

using namespace std;

struct Node
{
    int ans[4];
};

void solve()
{
    int n, m;
    cin >> n >> m;
    vector<string> g(n);

    for(int i = 0;i < n; i ++)      cin >> g[i];

    int dx[] = {0, 0, 1, -1}, dy[] = {1, -1, 0, 0};

    vector<vector<int>> block(n, vector<int> (m));//每个格子属于哪个连通块
    int cnt = 0;//连通块的数量
    
    vector<int> idx(1010);
    auto bfs = [&] (int x, int y, int id)
    {
        queue<pair<int, int>> q;
        q.push({x, y});
        block[x][y] = id;

        while(q.size())
        {
            auto [ix, iy] = q.front();
            q.pop();
            idx[id] ++;

            for(int i = 0;i < 4; i ++)
            {
                int a = dx[i] + ix, b = dy[i] + iy;
                if(a < 0 || a >= n || b < 0 || b >= m)        
                    continue;
                
                if(block[a][b] || g[a][b] == 'O')     continue;

                q.push({a, b});
                block[a][b] = id;
            }
        }
    };
    
    for(int i = 0;i < n; i ++)
        for(int j = 0;j < m; j ++)
            if(!block[i][j] && g[i][j] != 'O')
                bfs(i, j, ++ cnt);

    vector<pair<int, int>> p(cnt + 1);

    auto bfs1 = [&] (int x, int y, int d)
    {
        queue<pair<int, int>> q;

        q.push({x, y});

        int val = 0;
        while(q.size())
        {
            auto [ix, iy] = q.front();
            q.pop();

            val ++;

            int a = dx[d] + ix, b = dy[d] + iy;

            // if(ix == 1 && iy == 4 && d == 3)
            //     clog << a << ' ' << b << '\n';

            if(a < 0 || a >= n || b < 0 || b >= m)        
                    continue;
            if(g[a][b] == 'O')     continue;

            // if(ix == 1 && iy == 4 && d == 3)
            //     clog << a << ' ' << b << '\n';

            q.push({a, b});
        }

        return val;
    };

    vector<vector<Node>> f(n, vector<Node> (m));
    for(int i = 0;i < n; i ++)
        for(int j = 0;j < m; j ++)
        {
            if(g[i][j] == 'O')  continue;
            for(int u = 0;u < 4; u ++)
                f[i][j].ans[u] = bfs1(i, j, u);
        }
    
    int ans = 0;
    vector<bool> st(cnt + 1);
    for(int i = 0;i < n; i ++)
    {
        for(int j = 0;j < m; j ++)
        {
            if(g[i][j] == 'O')  continue;
            bool ok = true;
            for(int u = 0;u < n; u ++)
                for(int k = 0;k < m; k ++)
                {
                    if(block[i][j] == block[u][k])
                        continue;
                    int xx = 0;
                    for(int l = 0;l < 4; l ++)
                    {
                        if(f[i][j].ans[l] <= f[u][k].ans[l])
                            xx ++;
                    }
                    if(xx == 4)
                    {
                        ok = false;
                        break;
                    }
                }
            if(ok)  
                st[block[i][j]] = true;
            
            //clog << ok << ' ' << block[i][j] << '\n';
        }
    }

    for(int i = 1;i <= cnt; i ++)
        if(st[i])
            ans += idx[i];

    cout << ans << '\n';

}           

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int tt;
    cin >> tt;
    while(tt --)
    {
        solve();
    }
    return 0;
}