#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;

const int N = 2e3 + 10;
int n , m , now;
char a[N][N];
bool solve[N][N];
vector <pair<int , int>> can;
int dx[4] = {-1 , 1 , 0 , 0};
int dy[4] = {0 , 0 , -1 , 1};

bool check(int x , int y)
{
	if(x < 1 || y < 1 || x > n || y > m)
		return false;
	return true;
}

void Find_all(int x , int y , int fx , int fy)
{
	can.push_back({x - fx , y - fy});
	now++;
	solve[x][y] = true;
	for(int i = 0 ; i < 4 ; i++)  if(check(x + dx[i] , y + dy[i]) && a[x + dx[i]][y + dy[i]] != 'O')
	{
		if(solve[x + dx[i]][y + dy[i]])
			continue;
		Find_all(x + dx[i] , y + dy[i] , fx , fy);
	}
}

signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);  cout.tie(0);
	int Tc;  cin >> Tc;
	while(Tc--)
	{
		cin >> n >> m;
		for(int i = 1 ; i <= n ; i++)
			for(int j = 1 ; j <= m ; j++){
				solve[i][j] = false;
				cin >> a[i][j];
			}
		int ans = 0;
		for(int i = 1 ; i <= n ; i++)  for(int j = 1 ; j <= m ; j++)  if(a[i][j] != 'O' && !solve[i][j])
		{
			//cout << i << " : " << j  << endl;
			now = 0;
			Find_all(i , j , i , j);
			bool flg = true;
			for(int x = 1 ; x <= n ; x++)  for(int y = 1 ; y <= m ; y++)  if(a[x][y] != 'O')
			{
				if(x == i && y == j)
					continue;
				bool ali = true;
				for(auto u : can)   if(!check(x + u.F , y + u.S) || a[x + u.F][y + u.S] == 'O')
				{
					ali = false;
					break;
				}
				if(ali)
					flg = false;
			}
			ans += flg * now;
			can.clear();
		}
		cout << ans << '\n';
	}
	return 0;
}