#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
typedef long long LL;

inline int read(){
	int x = 0 , f = 1 ; char c = getchar() ;
    while( c < '0' || c > '9' ){if( c == '-' ) f = -1 ;c = getchar() ;} 
    while( c >= '0' && c <= '9' ) { x = x * 10 + c - '0' ; c = getchar() ; }
    return x * f ;
}

const int maxn = 1024;
int n,m;
int f[maxn][maxn],cnt[maxn];
char S[maxn][maxn];
bool vis[maxn][maxn];

int dx[] = {0,-1,0,1};
int dy[] = {1,0,-1,0};

int id(int x,int y){
	return (x - 1) * m + y;
}

bool in(int x,int y){
	return 1 <= x && x <= n && 1 <= y && y <= m;
}

void dfs(int x,int y,int i,int j){
	if(in(x,y)&&in(i,j)){
		if(vis[id(x,y)][id(i,j)]) return ;
		vis[id(x,y)][id(i,j)] = 1;
//		if(x==1&&y==4) cout<<i<<" "<<j<<endl;
		cnt[id(x,y)]++;
	}
	for(int c=0;c<4;c++){
		int xt = x + dx[c];
		int yt = y + dy[c];
		int it = i + dx[c];
		int jt = j + dy[c];
		if(in(xt,yt) && in(it,jt) && S[xt][yt]=='.'){
			dfs(xt,yt,it,jt);
		}
	}
}

void solve(){
	n = read();m = read();
	for(int i=1;i<=n;i++){
		scanf("%s",S[i]+1);
		for(int j=1;j<=m;j++) vis[i][j] = cnt[id(i,j)] = 0;
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			if(S[i][j]!='.') continue;
			int t = id(i,j);
			for(int x=1;x<=n;x++){
				for(int y=1;y<=m;y++){
					if(S[x][y]=='.') continue;
					dfs(i,j,x,y);
					//cnt[id(i,j)]++;
				}
			}
			for(int x=1;x<=n;x++){
				dfs(i,j,x,0);
				dfs(i,j,x,m+1);
			}
			for(int y=1;y<=m;y++){
				dfs(i,j,0,y);
				dfs(i,j,n+1,y);
			}
		}
	}
	int Ans = 0;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++){
			if(S[i][j]=='0') continue;
//			cout<<i<<" "<<j<<" "<<cnt[id(i,j)]<<endl;
			Ans += cnt[id(i,j)]==(n*m-1);
		}
	printf("%d\n",Ans);
}

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