#include <iostream>
#include <cstdio>
#include <vector>
#include <utility>
#define P pair<int, int>
using namespace std;

const int N = 2e3 + 5, M = 1e3 + 5;
vector<P> record[N][N];
int n, m, cnt[N][N];
bool vis[N][N], axis[N][N];
int dicx[4] = {0, 0, -1, 1};
int dicy[4] = {1, -1, 0, 0};
void dfs(int x, int y, int ox, int oy){
	vis[x][y] = true;
	record[x - ox + 1 + M][y - oy + 1 + M].push_back({ox, oy});
	cnt[ox][oy]++;
	for(int i = 0; i < 4; i++){
		int sx = x + dicx[i], sy = y + dicy[i];
		if(sx <=0 || sy <= 0 || sx > n || sy > m || vis[sx][sy] || axis[sx][sy])
			continue;
		dfs(sx, sy, ox, oy);
	}
}
void solution(){
	cin >> n >> m;
	for(int i = 1; i <= n + 1; i++){
		for(int j = 1; j <= m + 1; j++)
			cnt[i][j] = axis[i][j] = vis[i][j] = false;
	}
	for(int i = M - n; i<= M  + n + 1; i++){
		for(int j = M - m; j <= M + m + 1; j++)
			record[i][j].clear();
	}
	for(int i = 1; i <= n; i++){
		string str; cin >> str;
		for(int j = 0; j < m; j++) axis[i][j + 1] = (str[j] == 'O');
	}
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= m; j++){
			if(vis[i][j] || axis[i][j]) continue;
			dfs(i, j, i, j);
		}
	}
	int ans = 0;
	for(int i = M - n; i<= M  + n + 1; i++){
		for(int j = M - m; j <= M + m + 1; j++)
			ans += (record[i][j].size() == 1 ? cnt[record[i][j][0].first][record[i][j][0].second] : 0);
	}
	printf("%d", ans);
}

int main(){
	int t; cin >> t;
	while(t--){
		solution();
		if(t) cout << "\n";
	}
}
/*
4
2 5
.OO..
O..O.
1 3
O.O
1 3
.O.
2 3
OOO
OOO
*/