#include<bits/stdc++.h>
using namespace std;
typedef long long ak;
#define im INT_MAX
#define F(i,j,k) for(int i=j;i<=k;i++)
#define G(i,j,k) for(int i=j;i>=k;i--)
int cnt,xx,yy,n,m,mp[1111][1111],alive[1111];
struct posi{int x;int y;};
deque<posi>shape[1111][1111];
bool lpc(posi i,posi j){
	return i.x==j.x?(i.y<j.y):(i.x<j.x);
}
void zmg(int x,int y,int ox,int oy,int ord){
	mp[x][y]=ord;posi tmp;tmp.x=ox,tmp.y=oy;
	shape[xx][yy].push_back(tmp);
	if(mp[x][y-1]==-1)zmg(x,y-1,ox,oy-1,ord);
	if(mp[x][y+1]==-1)zmg(x,y+1,ox,oy+1,ord);
	if(mp[x-1][y]==-1)zmg(x-1,y,ox-1,oy,ord);
	if(mp[x+1][y]==-1)zmg(x+1,y,ox+1,oy,ord);
	return;
}
void gmz(int x,int y,int ox,int oy,int ord){
	posi tmp;tmp.x=ox,tmp.y=oy;
	shape[xx][yy].push_back(tmp);
	mp[x][y]=0;
	if(mp[x][y-1]==ord)gmz(x,y-1,ox,oy-1,ord);
	if(mp[x][y+1]==ord)gmz(x,y+1,ox,oy+1,ord);
	if(mp[x-1][y]==ord)gmz(x-1,y,ox-1,oy,ord);
	if(mp[x+1][y]==ord)gmz(x+1,y,ox+1,oy,ord);
	mp[x][y]=ord;
	return;
}
bool cxk(int vc,int vx,int vy,int kc,int kx,int ky){
	F(i,0,shape[vx][vy].size()-1){
		int dx=shape[vx][vy][i].x;
		int dy=shape[vx][vy][i].y;
		if((kx+dx<1)||(ky+dy<1))return 0;
		if((kx+dx>n)||(ky+dy>m))return 0;
		if(mp[kx+dx][ky+dy]!=kc)return 0;
	}
	return 1;
}
int main(){
	ios::sync_with_stdio(0);
	int t;cin>>t;
	F(fuck,1,t){
		cin>>n>>m;
		F(i,1,n)F(j,1,m){
			while(shape[i][j].size())shape[i][j].pop_back();
		}
		F(i,1,n){
			string s;cin>>s;
			F(j,0,m-1)mp[i][j+1]=0-(s[j]=='.');
		}
		F(j,0,m+1)mp[0][j]=mp[n+1][j]=0;
		F(i,0,n+1)mp[i][0]=mp[i][m+1]=0;
		cnt=0;
		F(i,1,n)F(j,1,m){
			xx=i,yy=j;
			if(mp[i][j]==-1)zmg(i,j,0,0,++cnt);
			else if(mp[i][j])gmz(i,j,0,0,mp[i][j]);
		}
		
//		F(i,1,n){
//			F(j,1,m)cout<<mp[i][j];
//			cout<<"\n";
//		}
//		
//		cout<<"cnt = "<<cnt<<"\n";
		
//		F(i,1,n)F(j,1,m)
//			sort(shape[i][j],shape[i][j]+shape[i][j].size(),lpc);
		F(i,1,cnt)alive[i]=1;alive[0]=0;
		F(k,1,cnt){
			int sx,sy;
			F(i,1,n){
				bool flg=0;
				F(j,1,m)if(mp[i][j]==k){
					sx=i,sy=j;flg=1;break;
				}
				if(flg)break;
			}
			F(i,1,n){
				bool flg=0;
				F(j,1,m){
					if((mp[i][j]==k)||(mp[i][j]==0))continue;
//					if(alive[mp[i][j]]==0)continue;
					if(cxk(k,sx,sy,mp[i][j],i,j)){
						alive[k]=0;flg=1;break;
					}
				}
				if(flg)break;
			}
		}
		int ans=0;
		F(i,1,n)F(j,1,m)if(alive[mp[i][j]])ans++;
		cout<<ans<<"\n";
	}
	return 0;
}