# include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 5; 
int n, m; 
int dx[4] = {-1, 1, 0, 0};
int dy[4] = {0, 0, -1, 1}; 
bool flag[N][N], vis[N][N], can[N][N], tmp[N][N]; 
struct node
{
	int x, y;
};
node operator + (const node &x, const node &y)
{
	return {x.x + y.x, x.y + y.y}; 
}
bool compare(const node &x, const node &y)
{
	return (x.x == y.x) ? x.y < y.y : x.x < y.x; 
}
vector <vector <node> > G; 
bool In(int x, int y)
{
	return (x >= 1 && x <= n && y >= 1 && y <= m); 
}
void dfs(int x, int y, vector <node> &T)
{
	vis[x][y] = 1; 
	T.push_back({x, y}); 
	for(int i = 0; i < 4; i++)
	{
		int wx = x + dx[i], wy = y + dy[i]; 
		if(In(wx, wy) && flag[wx][wy] && !vis[wx][wy])
		{
			dfs(wx, wy, T); 
		}
	}
	return; 
}
void pcan(void)
{
	for(int i = 1; i <= n; i++)
		for(int j = 1; j <= m; j++)
			printf("%d%c", can[i][j] ? 1 : 0, " \n"[j == m]); 
	return; 
}
int main(void)
{
	// freopen("A.in", "r", stdin); 
	// freopen("A.out", "w", stdout);
	int Test; scanf("%d", &Test);
	while(Test--)
	{
		scanf("%d%d", &n, &m); 
		G.clear();
		for(int i = 1; i <= n; i++)
		{
			for(int j = 1; j <= m; j++)
			{
				char opt; cin >> opt; 
				flag[i][j] = (opt == '.'); can[i][j] = tmp[i][j] = 0; 
			}
		}
		for(int i = 1; i <= n; i++)
		{
			for(int j = 1; j <= m; j++)
			{
				if(!vis[i][j] && flag[i][j]) 
				{
					vector <node> T; 
					dfs(i, j, T); 
					G.push_back(T); 
				}
			}
		}
		int ans = 0; 
		for(auto &S : G) // 枚举连通块
		{
			sort(S.begin(), S.end(), compare); 
			// printf("LTK : \n"); 
			// for(auto I : S) printf("%d, %d\n", I.x, I.y);
			// printf("\n\n");
			// solve f[0] 
			bool okk = 1; 
			for(int i = 1; i <= n; i++)
			{
				for(int j = 1; j <= m; j++)
				{
					// printf("i = %d, j = %d\n", i, j);
					if(!flag[i][j]) {can[i][j] = 0; continue; }
					if(i == S[0].x && j == S[0].y) {can[i][j] = 1; continue; }
					bool ok = 1; 
					for(auto I : S) 
					{
						int wx = i + (I.x - S[0].x), wy = j + (I.y - S[0].y); 
						// printf("LTK : %d, %d\nwx = %d, wy = %d\n", I.x, I.y, wx, wy); 
						if(!In(wx, wy) || !flag[wx][wy]) {ok = 0; break; }
					}
					can[i][j] = ok; 
					if(can[i][j]) okk = 0; 
				}
			}
			// printf("LTKpcan : %d, %d\n", S[0].x, S[0].y); 
			// pcan(); 
			if(okk) ++ans; 
			//solve f[k]
			for(int k = 1; k < (int)S.size(); k++)
			{
				okk = 1; 
				for(int i = 1; i <= n; i++)
					for(int j = 1; j <= m; j++) tmp[i][j] = can[i][j], can[i][j] = 0; 
				node delta = {S[k - 1].x - S[k].x, S[k - 1].y - S[k].y}; 
				for(int i = 1; i <= n; i++)
				{
					for(int j = 1; j <= m; j++)
					{
						if(!flag[i][j]) {can[i][j] = 0; continue; }
						if(i == S[k].x && j == S[k].y) {can[i][j] = 1; continue; }
						node New = (node){i, j} + delta; 
						can[i][j] = In(New.x, New.y) ? tmp[New.x][New.y] : 0; 
						if(can[i][j]) okk = 0; 
					}
				}
				if(okk) ++ans; 
				// printf("LTKpcan : %d, %d\n", S[k].x, S[k].y); 
				// pcan(); 
			}
		}
		printf("%d\n", ans);
	}
	return 0; 
}