#include <iostream>
#include <cstring>
#include <queue>
using namespace std;
const int N = 1e3 + 5;
int id[N][N], idx, n, m, t, res, dx[4] = {0, -1, 0, 1}, dy[4] = {-1, 0, 1, 0};
vector<pair<int, int>> dot[N];
char g[N][N];
bool st[N][N];
void bfs(int sx, int sy, int num)
{
    id[sx][sy] = num;
    queue<pair<int, int>> q;
    q.push({sx, sy});
    while (q.size())
    {
        auto t = q.front();
        q.pop();
        for (int i = 0; i < 4; i++)
        {
            int xx = dx[i] + t.first, yy = dy[i] + t.second;
            if (xx < 1 || xx > n || yy < 1 || yy > m || id[xx][yy] || g[xx][yy] == 'O')
                continue;
            id[xx][yy] = num, dot[num].push_back({xx - sx, yy - sy}), q.push({xx, yy});
        }
    }
}
bool check(int u)
{
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
        {
            int num = id[i][j], flag = 1;
            if (g[i][j] == 'O' || num == u || st[u][num])
                continue;
            for (int k = 0; flag && k < dot[u].size(); k++)
            {
                int xx = i + dot[u][k].first, yy = j + dot[u][k].second;
                if (g[xx][yy] == 'O' || id[xx][yy] != num)
                    flag = 0;
            }
            st[u][num] = flag;
        }
    for (int i = 1; i <= idx; i++)
        if (st[u][i])
            return false;
    return true;
}
int main()
{
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    cin >> t;
    while (t--)
    {
        cin >> n >> m, idx = res = 0;
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= m; j++)
                cin >> g[i][j], id[i][j] = 0, st[i][j] = false;
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= m; j++)
                if (g[i][j] == '.' && !id[i][j])
                    bfs(i, j, ++idx);
        for (int i = 1; i <= idx; i++)
            if (check(i))
                res += dot[i].size() + 1;
        for (int i = 1; i <= idx; i++)
            dot[i].clear();
        cout << res << "\n";
    }
}