#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=1e3+5,M=N*4+5,K=1000+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(263082);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
}using namespace Debug;
int n,m,vis[N][N];char s[N][N];
vector<pii> S[N][N];
void dfs(int x,int y,int sx,int sy){
	if(x<1||y<1||x>n||y>m||vis[x][y]||s[x][y]^'.') return;
	vis[x][y]=1;S[sx][sy].emplace_back(x-sx,y-sy);
	for(int ox:{-1,0,1}) for(int oy:{-1,0,1}) if(!(ox*oy)) dfs(x+ox,y+oy,sx,sy);
}
int CK(int sx,int sy,int tx,int ty){
	for(auto i:S[sx][sy]){
		auto p=LB(S[tx][ty].begin(),S[tx][ty].end(),i);
		if(p==S[tx][ty].end()||(*p)!=i) return 0;
	} 
	return 1;
}
void Solve(){
	int i,j;scanf("%d%d",&n,&m);
	for(i=1;i<=n;i++) scanf("%s",s[i]+1);
	int ans=0;
	for(i=1;i<=n;i++) for(j=1;j<=m;j++) if(s[i][j]=='.'){
		for(int x=1;x<=n;x++) fill(vis[x]+1,vis[x]+m+1,0);
		S[i][j].clear();dfs(i,j,i,j);
		sort(S[i][j].begin(),S[i][j].end());
		ans++;
	}
	for(i=1;i<=n;i++) fill(vis[i]+1,vis[i]+m+1,0);
	for(i=1;i<=n;i++) for(j=1;j<=m;j++)if(!vis[i][j]&&s[i][j]=='.'){
		int flag=0;
		for(int x=1;x<=n&&!flag;x++) for(int y=1;y<=m&&!flag;y++) if((i^x||j^y)&&s[x][y]=='.'&&CK(i,j,x,y)) flag=1;
		if(flag) ans-=S[i][j].size();
		for(auto p:S[i][j]) vis[i+p.fi][j+p.se]=1;
	}
	printf("%d\n",ans);
}
int main(){
	int t=1;
	scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}