#include<bits/stdc++.h>
using namespace std;

int n, m; 
int d[4][2] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}};
vector<vector<vector<vector<int>>>> f;
const int N = 1e3 + 5;
bool st[N][N];
string g[N];
bool dp(int x, int y, int u, int v)
{
    if(g[x][y] == 'O') return false;
    if(u < 0 || u >= n || v < 0 || v >= m) return true;
    if(g[u][v] == 'O') return true;
    if(f[x][y][u][v] != -1) return f[x][y][u][v];
    st[x * n + y][u * n + v] = true;
    bool flag = false;
    bool ok = false;
    for(int i = 0; i < 4; i++)
    {
        int tx = x + d[i][0], ty = y + d[i][1];
        int tu = u + d[i][0], tv = v + d[i][1];
        if(tx < 0 || tx >= n || ty < 0 || ty >= m) continue;
        if(tu >= 0 && tu < n && tv >= 0 && tv < m && st[tx * n + ty][tu * n + tv])
        {
            ok = true;
            continue;
        }
        if(g[tx][ty] == 'O') continue;

        if(dp(tx, ty, tu, tv))
        {
            flag = true;
            break;
        }
    }    
    st[x * n + y][u * n + v] = false;
    if(ok) return flag;
    return f[x][y][u][v] = flag;
}

void solve()
{
    cin >> n >> m;
    f.clear();
    f.resize(n, vector<vector<vector<int>>>(m, vector<vector<int>>(n, vector<int>(m, -1))));
    for(int i = 0; i < n; i++) cin >> g[i];
    int ans = 0;
    
    for(int i = 0; i < n; i++)
        for(int j = 0; j < m; j++)
        {
            if(g[i][j] == 'O') continue;
            bool flag = true;
            for(int u = 0; u < n; u++)
            {
                if(!flag) break;
                for(int v = 0; v < m; v++)
                {
                    if(u == i && v == j) continue;
                    if(!dp(i, j, u, v))
                    {
                        flag = false;
                        break;
                    }
                }
            }
            if(flag)
            {
                // cout << i << " " << j << "\n";
                ans++;
            }
        }
    cout << ans << "\n";
}

int main()
{
	int t = 1; 
	cin >> t;
	while(t--)
	{
		solve();
	}
}