// In the name of Allah

#include <bits/stdc++.h>
using namespace std;

typedef 	long long int			ll;
typedef 	long double				ld;
typedef 	pair<int, int>			pii;
typedef 	pair<ll, ll>			pll;
typedef 	complex<ld>				cld;

#define 	all(x)					(x).begin(),(x).end()
#define 	len(x)					((ll) (x).size())
#define 	F						first
#define 	S						second
#define		X						real()
#define		Y						imag()
#define 	pb						push_back
#define 	sep						' '
#define 	endl					'\n'
#define 	Mp						make_pair
#define 	kill(x)					cout << x << '\n', exit(0)
#define 	set_dec(x)				cout << fixed << setprecision(x);
#define 	file_io(x,y)			freopen(x, "r", stdin); freopen(y, "w", stdout);

int n, m;
const int maxn = 2e5 + 4;
vector<char> s[maxn]; int M[maxn];
int mark[maxn], col[maxn], c = 0;
int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
vector<pii> A[maxn];

int GI(int i, int j) {
	return (i * m + j);
}

pii Gp(int v) {
	return Mp(v / m, v % m);
}

void dfs(int v) {
	auto f = Gp(v);
	int x = f.F, y = f.S;
	mark[v] = 1; col[v] = c; A[c].pb(Mp(x, y));
	for (int T = 0; T < 4; T++) {
		int x1 = x + dx[T], y1 = y + dy[T];
		if (x1 >= 0 && x1 < n && y1 >= 0 && y1 < m && s[x1][y1] == '.') {
			int u = GI(x1, y1);
			if (!mark[u]) dfs(u);
		}
	}
}

bool ok(int i, int j) {
	auto f = A[i][0];
	for (auto g : A[j]) {
		pii d = Mp(g.F - f.F, g.S - f.S);
		bool flag = 1;
		for (auto r : A[i]) {
			int x1 = r.F + d.F, y1 = r.S + d.S;
			if (!(x1 >= 0 && x1 < n && y1 >= 0 && y1 < m && col[GI(x1, y1)] == j)) {
				flag = 0;
				break;
			}
		}
		if (flag) return 1;
	}
	return 0;
}

int main() {
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	
	int T;
	cin >> T;
	while (T--) {
		cin >> n >> m;
		for (int i = 0; i < n; i++) {
			s[i].clear(); s[i].resize(m);
			for (int j = 0; j < m; j++) cin >> s[i][j];
		}
		
		fill(mark, mark + (n * m), 0); c = 0;
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				if (s[i][j] != '.') continue;
				int v = GI(i, j);
				if (!mark[v]) {
					A[c].clear();
					dfs(v); c++;
				}
			}
		}
		
		fill(M, M + c, 1);
		for (int i = 0; i < c; i++) {
			for (int j = i + 1; j < c; j++) {
				if (len(A[i]) == len(A[j])) {
					if (ok(i, j)) {
						M[i] = 0; M[j] = 0;
					}
				}
				else if (len(A[i]) > len(A[j])) {
					if (ok(j, i)) M[j] = 0;
				}
				else {
					if (ok(i, j)) M[i] = 0;
				}
			}
		}
		
		int res = 0;
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				if (s[i][j] != '.') continue;
				int v = GI(i, j);
				if (M[col[v]]) res++;
			}
		}
		cout << res << endl;
	}
	
	return 0;
}