#include<bits/stdc++.h>
#define ull unsigned long long 
using namespace std;
const int N=1e6+100;
int n,m;
ull h1[N],h2[N];
int c[N];
vector<int>vis[N];
string s[N];
int chk(int l,int mid){return mid-c[mid]+1<=l;}
void manacher(ull *s,int n,int &l,int &r)
{
	int R=0,mid=0;s[n+1]=123848755314ull;
	for(int i=1;i<=n;i++)
	{
		c[i]=i>R?0:min(R-i,c[2*mid-i]);
		while(i-c[i]>0&&s[i-c[i]]==s[i+c[i]+1])c[i]++;
		if(i+c[i]>R)R=i+c[i],mid=i;
	}
	l=1;for(int i=1;i+i-l<n;i++)if(chk(l,i))l=i+1;
	r=n;for(int i=n-1;i-(r-i-1)>=l;i--)if(chk(i-(r-i-1),i))r=i;
}
int l1,l2,r1,r2;
const int dx[]={1,-1,0,0},dy[]={0,0,1,-1};
void dfs(int x,int y)
{
	vis[x][y]=1;
	for(int i=0;i<4;i++)
	{
		int tx=x+dx[i],ty=y+dy[i];
		if(tx>=l1&&ty>=l2&&tx<=r1&&ty<=r2&&s[tx-1][ty-1]=='0'&&!vis[tx][ty])dfs(tx,ty);
	}
}
void solve()
{
	cin>>n>>m;
	for(int i=0;i<n;i++)cin>>s[i];
	for(int i=1;i<=max(n,m)+1;i++)h1[i]=h2[i]=0;
	for(int i=1;i<=n;i++)vis[i].resize(m+1);
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
			h1[i]=h1[i]*2+(s[i-1][j-1]=='0'),
			h2[j]=h2[j]*2+(s[i-1][j-1]=='0'),
			vis[i][j]=0;
	manacher(h1,n,l1,r1),manacher(h2,m,l2,r2);
	int ans=0;
	for(int i=l1;i<=r1;i++)
		for(int j=l2;j<=r2;j++)
			if(!vis[i][j]&&s[i-1][j-1]=='0')dfs(i,j),ans++;
	cout<<ans<<endl;
}
signed main()
{
	ios::sync_with_stdio(0);
	int _;cin>>_;
	while(_--)solve();
	return 0;
}