#include<bits/stdc++.h>
#define inf 1e9
#define eps 1e-6
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define REP(i,a,b) for(int i=a;i>=b;i--)
#define db double
#define ve vector<int>
#define pa pair<int,int>
#define fr first
#define sd second
#define pb push_back
#define mp make_pair
#define MEM(a) memset(a,0,sizeof(a))
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
inline ll read()
{
	char ch = getchar();
	ll s = 0, w = 1;
	while (ch < '0' || ch > '9') {if (ch == '-')w = -1; ch = getchar();}
	while (ch >= '0' && ch <= '9') {s = s * 10 + ch - '0'; ch = getchar();}
	return s * w;
}
#define N 4010
int b[N], fa[N];
bool vst[N][N];
int tg[N];
string s;
int n, m;
int X[4] = { -1, 1, 0, 0}, Y[4] = {0, 0, 1, -1};
int find(int x) {return (x == fa[x] ? x : fa[x] = find(fa[x]));}
int idx(int x, int y) {return x * (m + 2) + (y + 1);}
int ck(int x, int y) {return (x >= 1 && x <= n && y >= 1 && y <= m && b[idx(x, y)]);}
void mer(int x, int y) {x = find(x), y = find(y); fa[y] = x;}
int ck(int ax, int ay, int bx, int by)
{
	queue<pair<pair<int, int>, pair<int, int>>>q;
	vector<pair<int, int>>V; int flag = 0;
	q.push({{ax, ay}, {bx, by}});
	while (!q.empty())
	{
		auto [A, B] = q.front(); q.pop();
		if (!ck(A.fr, A.sd))continue;
		if (!ck(B.fr, B.sd)) {flag = 1; break;}
		for (int i = 0; i < 4; i ++)
		{
			int tax = A.fr + X[i], tay = A.sd + Y[i], tbx = B.fr + X[i], tby = B.sd + Y[i];
			if (!vst[idx(tax, tay)][idx(tbx, tby)])
			{
				vst[idx(tax, tay)][idx(tbx, tby)] = 1;
				q.push({{tax, tay}, {tbx, tby}});
				V.push_back({idx(tax, tay), idx(tbx, tby)});
			}
		}
	}
	for (auto [x, y] : V)vst[x][y] = 0;
	return flag;
}
void sol()
{
	cin >> n >> m;
	for (int i = 1; i <= n; i ++)
	{
		cin >> s;
		for (int j = 1; j <= m; j ++)b[idx(i, j)] = (s[j - 1] == '.');
	}
	for (int i = 1; i <= n; i ++)for (int j = 1; j <= m; j ++)if (b[idx(i, j)])fa[idx(i, j)] = idx(i, j);
	for (int i = 1; i <= n; i ++)for (int j = 1; j <= m; j ++)if (b[idx(i, j)])
			{
				for (int p = 0; p < 4; p ++)
				{
					int ti = i + X[p], tj = j + Y[p];
					if (ck(ti, tj))mer(idx(i, j), idx(ti, tj));
				}
			}
	for (int i = 1; i <= n; i ++)for (int j = 1; j <= m; j ++)if (b[idx(i, j)] && fa[idx(i, j)] == idx(i, j))
			{
				int flag = 1;
				for (int p = 1; p <= n; p ++)for (int q = 1; q <= m; q ++)if (b[idx(p, q)])
						{
							if (p == i && q == j)continue;
							if (!ck(i, j, p, q))flag = 0;
						}
				tg[idx(i, j)] = flag;
			}
	int ans = 0;
	for (int i = 1; i <= n; i ++)for (int j = 1; j <= m; j ++)if (b[idx(i, j)])
			{
				ans += tg[find(idx(i, j))];
			}
	cout << ans << '\n';
	for (int i = 0; i <= n + 1; i ++)for (int j = 0; j <= m + 1; j ++)tg[idx(i, j)] = fa[idx(i, j)] = b[idx(i, j)] = 0;
}
signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	int T0; cin >> T0;
	while (T0 --)sol();
	return 0;
}
/*
2
3 4 6
2 1 15
7 1 9
13 3 2
3 6 1 2
5 2 15 3
3 3 3
1 1
2 2
3 3
1 1 1
2 2 2
*/