#include<bits/stdc++.h>
using namespace std;
const int N = 5001;
char tu[N][N];
int vis[N][N];
int movee[] = { -1,0,1,0,-1 };
int cnt = 1;
vector<vector<array<int, 2>>>dxdy(N);
int n, m;
void dfs(int x, int y)
{
    queue<array<int, 2>>que;
    que.push({ x,y });
    vis[x][y] = cnt;
    while (!que.empty())
    {
        auto [tx, ty] = que.front();
        dxdy[cnt].push_back({ tx - x,ty - y });
        que.pop();
        //vis[tx][ty] = cnt;
        for (int i = 0; i < 4; i++)
        {
            int nx = tx + movee[i]; int ny = ty + movee[i + 1];
            if (nx <= 0 || nx > n || ny <= 0 || ny > m || vis[nx][ny] || tu[nx][ny] == 'O')continue;
            vis[nx][ny] = cnt;
            que.push({nx,ny });
        }
    }
}
void init(int n, int m)
{
    for (int i = 1; i <= n * m; i++)
    {
        dxdy[i].clear();
    }
    for (int i = 1; i <= n; i++)for (int j = 1; j <= m; j++)
    {
        vis[i][j] = 0;
    }
    cnt = 1;
}
void solve()
{
    cin >> n >> m;
    init(n, m);
    for (int i = 1; i <= n; i++)for (int j = 1; j <= m; j++)
    {
        cin >> tu[i][j];
    }
    for (int i = 1; i <= n; i++)for (int j = 1; j <= m; j++)
    {
        if (!vis[i][j] && tu[i][j] == '.')
        {
            dfs(i, j);
            cnt++;
        }
      
    }
  /*  if (cnt == 2)
    {
        cout << n * m << endl;
        return ;
    }*/
   /* for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= m; j++)
        {
            cout << vis[i][j] << "";
        }
        cout << endl;
    }*/
    int ans = 0;
    for (int k = 1; k < cnt; k++)
    {
        int flag = 1;
            for (int i = 1; i <= n; i++)
            {
                if (!flag)break;
                int j;
                for (j = 1; j <= m; j++)
                {
                    if (vis[i][j] == k||tu[i][j]=='O')continue;
                    int l;
                    for (l=0;l<dxdy[k].size();l++)
                    {
                    
                        int dx = dxdy[k][l][0]; int dy = dxdy[k][l][1];
                        int nx = i + dx; int ny = j + dy;
                        if (nx <= 0 || nx > n || ny <= 0 || ny > m || tu[nx][ny] == 'O')
                        {
                            break;
                        }
                    }
                    if (l == dxdy[k].size()) {
                        flag = false;
                    }
                }
               
            }

        
        if (flag)ans += dxdy[k].size();
    }
    cout << ans << endl;
}
signed main()
{
    ios::sync_with_stdio(false); cin.tie(0);
    int T; cin >> T;
    while (T--)
    {
        solve();
    }

}
/*
 4
 2 5
 .OO..
 O..O.
 1 3
 O.O
 1 3
 .O.
 2 3
 OOO
 OOO
*/