#include"bits/stdc++.h"
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
int main()
{
	ios::sync_with_stdio(0); cin.tie(0);
	int T; cin>>T;
	while (T--)
	{
		int n,m,i,j;
		cin>>n>>m;
		vector a(n,vector<int>(m));
		vector<int> ed(4*(n+2)*(m+2));
		for (auto &v:a)
		{
			string s;
			cin>>s;
			for (j=0; j<m; j++) v[j]=s[j]=='.';
		}
		auto av=[&](int x,int y)
			{
				return x>=0&&x<n&&y>=0&&y<m;
			};
		int ans=0;
		vector<vector<pair<int,int>>> cc;
		vector blk(n,vector<int>(m,-1));
		int ID=0;
		for (i=0; i<n; i++) for (j=0; j<m; j++) if (a[i][j])
		{
			vector<pair<int,int>> cur;
			function<void(int,int)> dfs=[&](int x,int y)
				{
					if (!av(x,y)||a[x][y]==0) return;
					cur.push_back({x,y});
					a[x][y]=0; blk[x][y]=ID;
					dfs(x+1,y); dfs(x-1,y); dfs(x,y+1); dfs(x,y-1);
				};
			dfs(i,j);
			for (auto [x1,y1]:cur)
			{
				for (auto [x2,y2]:cur)
				{
					x2-=x1; y2-=y1;
					++ed[(x2+n)*m+y2+m];
				}
				// cerr<<endl;
			}
			// cerr<<i<<' '<<j<<' '<<ID<<endl;
			++ID;
			cc.push_back({cur});
		}
		sort(all(cc),[&](auto &x,auto &y) { return x.size()<y.size(); });
		for (int id=0,jd; id<cc.size(); id++)
		{
			vector<pair<int,int>> &cur=cc[id];
			/*cerr<<"id = "<<id<<endl;
			for (auto [x,y]:cur)
			{
				cerr<<x<<' '<<y<<endl;
			}*/
			for (auto it=cur.rbegin(); it!=cur.rend(); ++it)
			{
				it->first-=cur[0].first;
				it->second-=cur[0].second;
			}
			for (jd=0; jd<cc.size(); jd++) if (id!=jd&&cc[jd].size()>=cc[id].size())
			{
				for (auto [X,Y]:cc[jd])
				{
					int cid=blk[X][Y];
					bool flg=0;
					for (auto [dx,dy]:cur)
					{
						if (!av(X+dx,Y+dy)||blk[X+dx][Y+dy]!=cid)
						{
							flg=1;
							break;
						}
					}
					if (!flg)
					{
						jd=cc.size()+1;
						break;
					}
				}
			}
			if (jd==cc.size())
			{
				ans+=cur.size();
			}
		}
		cout<<ans<<'\n';
	}
}