#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pii pair<int, int>
using namespace std;
inline int read(){
    int f=1,ans=0; char c=getchar();
    while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
    while(c>='0'&&c<='9'){ans=ans*10+c-'0';c=getchar();}
    return f*ans;
}
const int MAXN = 1e3 + 11;
int cas, N, M;
int Q(int x, int y){return (x - 1) * M + y;}
struct Union{
	int f[MAXN];
	void Init(){for(int i = 1; i <= N * M; i++) f[i] = i; return;}
	int find(int x){return f[x] == x ? x : f[x] = find(f[x]);}
	void merge(int x, int y){f[find(y)] = f[find(x)]; return;}
}U;
char str[MAXN][MAXN];
vector<pii> vec[MAXN];
int sta[MAXN], Ans;
bool vis[MAXN][MAXN];
bool G[MAXN];
int main(){
	//freopen("1.in", "r", stdin);
	cas = read();
	while(cas--){
		N = read(), M = read(); U.Init();
		int tot = 0;
		for(int i = 1; i <= N * M; i++) vec[i].clear();
		for(int i = 1;  i <= N; i++){
			scanf("%s", str[i] + 1);
		}
		for(int i = 1; i <= N; i++){
			for(int j = 1; j <= M; j++){
				if(j > 1 && str[i][j] == '.' && str[i][j - 1] == '.') U.merge(Q(i, j), Q(i, j - 1));
				if(i > 1 && str[i][j] == '.' && str[i - 1][j] == '.') U.merge(Q(i, j), Q(i - 1, j));
			}
		}/*
		for(int i = 1; i <= N; i++){
			for(int j = 1; j <= M; j++) cerr << U.find(Q(i, j)) << " "; cerr << endl;
		}*/
		for(int i = 1; i <= N; i++) for(int j = 1; j <= M; j++) if(str[i][j] == '.') vec[U.find(Q(i, j))].pb(mp(i, j));
		Ans = sta[0] = 0;
		for(int i = 1; i <= N; i++) for(int j = 1; j <= M; j++) if(U.find(Q(i, j)) == Q(i, j) && str[i][j] == '.') sta[++sta[0]] = Q(i, j);
		for(int i = 1; i <= N * M; i++) G[i] = 0;
		for(int i = 1; i <= sta[0]; i++){
			bool flag = 0;//flag = 1
			for(auto k: vec[sta[i]]){
				for(auto tp: vec[sta[i]]) vis[tp.fi - k.fi + N][tp.se - k.se + M] = 1;
				for(int j = 1; j <= sta[0]; j++){
					if(i == j) continue;
					bool g = 1; int cc = 0;
					for(auto tp: vec[sta[j]]){
						if(vis[tp.fi - vec[sta[j]][0].fi + N][tp.se - vec[sta[j]][0].se + M]){
							cc++;
						}
					}if(cc == vec[sta[j]].size()){
						//cerr<<i<<" "<<j<<endl;
						G[j] = 1;
					}
				}
				for(auto tp: vec[sta[i]]) vis[tp.fi - k.fi + N][tp.se - k.se + M] = 0;
			}
			//if(!flag) Ans += vec[sta[i]].size();
		}
		for(int i = 1; i <= sta[0]; i++) if(!G[i]) Ans += vec[sta[i]].size();

		printf("%d\n", Ans);
	}return 0;
}/*
1
2 5
.OO..
.O.O.
*/