#include <bits/stdc++.h>
using namespace std;
void solve() {
	int n,m;
	cin >> n >> m;
	int mp[n+1][m+1];
	for ( int i = 1 ; i <= n ; i++ ) {
		string s;
		cin >> s;
		for ( int j = 1 ; j <= m ; j++ ) {
			if ( s[j-1] == 'O' ) mp[i][j] = 1000000;
			else mp[i][j] = 0;
 		}
	}
	int opt[2][4] = {{-1,1,0,0},{0,0,-1,1}};
	struct node{
		int num,id;
		vector<int>mem;
	};
	vector<node>use;
	int idx = 100000;
	for ( int i = 1 ; i <= n ; i++ ) {
		for ( int j = 1 ; j <= m ; j++ ) {
			if ( mp[i][j] ) continue;
			queue<int>q;
			q.emplace(i*10000+j);
			int X = 0,Y = 0;
			int cnt = 0;
			vector<int>u;
			mp[i][j] = idx;
			while ( q.size() ) {
				int t = q.front();
				u.emplace_back(t);
				q.pop();
				int x = t/10000, y = t%10000;
				cnt++;
				for ( int k = 0 ; k < 4 ; k++ ) {
					int xx = x+opt[0][k],yy = y+opt[1][k];
					if ( xx && yy && xx <= n && yy <= m && idx > mp[xx][yy] ) {
						q.emplace(xx*10000+yy);
						mp[xx][yy] = idx;
					}
				}
			}
			use.emplace_back(cnt,idx,u);
			idx--;
		}
	}
	sort(use.begin(),use.end(),[&](node a, node b)->bool{
		return a.num > b.num;
	});
	int ans = 0;
	for ( int i = 0 ; i < use.size() ; i++ ) {
		int f = 1;
		for ( int j = 0 ; j < use.size() ; j++ ) {
			if ( i == j ) continue;
			for ( int p = -n ; p <= n ; p++ ) {
				for ( int q = -m ; q <= m ; q++ ) {
					int sum = 0;
					for ( auto k : use[j].mem ) {
						int x = k/10000+p, y = k%10000+q;
						if ( x && y && x <= n && y <= m && mp[x][y] == use[i].id ) {
							sum++;
						}  
					}
					if ( sum == use[i].num ) {
						f = 0;
						break;
					}
				}
				if ( f == 0 ) break; 
			}
			if ( f == 0 ) break;
		}
		if ( f ) ans += use[i].num;
	}
	cout << ans << '\n';
}	
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	int T = 1;
	cin >> T;
	while ( T-- ) {
		solve();
	}
}