#include <bits/stdc++.h>
#define pii pair <int , int>
#define pll pair <LL , LL>
#define mp make_pair
#define fs first
#define sc second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;

//const int Mxdt=100000;
//static char buf[Mxdt],*p1=buf,*p2=buf;
//#define getchar() p1==p2&&(p2=(p1=buf)+fread(buf,1,Mxdt,stdin),p1==p2)?EOF:*p1++;

template <typename T>
void read(T &x) {
	T f=1;x=0;char s=getchar();
	while(s<'0'||s>'9') {if(s=='-') f=-1;s=getchar();}
	while(s>='0'&&s<='9') {x=(x<<3)+(x<<1)+(s^'0');s=getchar();}
	x *= f;
}

template <typename T>
void write(T x , char s='\n') {
	if(!x) {putchar('0');putchar(s);return;}
	if(x<0) {putchar('-');x=-x;}
	T t = 0 , tmp[25] = {};
	while(x) tmp[t ++] = x % 10 , x /= 10;
	while(t -- > 0) putchar(tmp[t] + '0');
	putchar(s);
}

int n , m;
inline int Id(int x , int y) {
	return (x - 1) * m + y;
}


char s[1005];
int f[1005] , vis[1005] , Cnt[1005];
vector <pii> G[1005];

int findSet(int x) {
	if(f[x] != x) return f[x] = findSet(f[x]);
	return f[x];
}

bool calc(int x , int y , int cur) {
	for (auto c:G[cur]) {
		int u = x + c.fs , v = y + c.sc;
		if(u < 1 || u > n || v < 1 || v > m) return false;
		if(s[Id(u , v)] == 'O') return false;
	}
	return true;
}

bool check(int cur) {
	
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= m; ++j) if(s[Id(i , j)] == '.' && findSet(Id(i , j)) != cur) {
			if(calc(i , j , cur)) return false;
		}
	}
	
	return true;
}

void solve() {
	read(n),read(m);
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= m; ++j) {
			char c=getchar();
			while(c != '.' && c != 'O') c = getchar();
			s[Id(i , j)] = c;
		}
	}
	
	for (int i = 1; i <= n * m; ++i) f[i] = i;
	
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= m; ++j) if(s[Id(i , j)] == '.') {
			if(i > 1 && s[Id(i - 1 , j)] == '.') f[findSet(Id(i , j))] = f[findSet(Id(i - 1 , j))];
			if(j > 1 && s[Id(i , j - 1)] == '.') f[findSet(Id(i , j))] = f[findSet(Id(i , j - 1))];
		}
	}
	
	int ans = 0;
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= m; ++j) if(s[Id(i , j)] == '.') {
			Cnt[findSet(Id(i , j))] ++;
			int cur = findSet(Id(i , j));
			int x = (cur - 1) / m + 1 , y = (cur - 1) % m + 1;
			G[findSet(Id(i , j))].push_back(mp(i - x , j - y));
		}
	}
	
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= m; ++j) if(s[Id(i , j)] == '.') {
			if(vis[findSet(Id(i , j))]) continue;
			vis[findSet(Id(i , j))] = 1;
			if(check(findSet(Id(i , j)))) ans += Cnt[findSet(Id(i , j))];
		}
	}
	
	write(ans);
	for (int i = 1; i <= n * m; ++i) vis[i] = 0 , G[i].clear() , Cnt[i] = 0;
	
} 

int main() {
	
	int T;read(T);
	while(T -- > 0) solve();
	
	return 0;
}