#include<bits/stdc++.h>
using namespace std;
inline int read() {
	int x = 0, f = 1;
	char ch = getchar();
	while(ch < '0' || ch > '9') {
		if(ch == '-') f = -1;
		ch = getchar();
	}
	while(ch >= '0' && ch <= '9') {
		x = (x << 1) + (x << 3) + (ch ^ 48);
		ch = getchar();
	}
	return x * f;
}
struct Node {
	int n, m;
}str[5010];
int T, n, m, opt;
char ch;
int e[5010][5010], vis[5010][5010], win[5010];
void DFS(int x, int y, int num) {
	if(vis[x][y] != 0 || e[x][y] == 0) return;
	vis[x][y] = num;
	DFS(x + 1, y, num);
	DFS(x, y + 1, num);
	DFS(x - 1, y, num);
	DFS(x, y - 1, num);
}
bool v[5010][5010];
void clear(int x, int y) {
	if(v[x][y] == 0) return;
	v[x][y] = 0;
	clear(x + 1, y);
	clear(x - 1, y); 
	clear(x, y + 1); 
	clear(x, y - 1);
}
void cmp(int x, int y, int xa, int yb) {
	if(opt == 0 || v[x][y] == 1) return;
    if(e[x][y] == 0) return;
	if(e[xa][yb] == 0) {
		opt = 0;
		return;
	}
	v[x][y] = 1;
	cmp(x + 1, y, xa + 1, yb);
	cmp(x - 1, y, xa - 1, yb); 
	cmp(x, y + 1, xa, yb + 1); 
	cmp(x, y - 1, xa, yb - 1); 
	return;
}
int num = 0;
void Solve() {
	num = 0;
	for(int i = 1; i <= n; ++i) {
		for(int j = 1; j <= m; ++j) {
			if(e[i][j] == 1 && vis[i][j] == 0) {
				num += 1;
				DFS(i, j, num);
			}
		}
	}
//	for(int i = 1; i <= n; ++i) {
//		for(int j = 1; j <= m; ++j) {
//			cout << vis[i][j];
//		}
//		cout << endl;
//	}
    for(int i = 1; i <= n; ++i) {
    	for(int j = 1; j <= m; ++j) {
    		int nm = vis[i][j];
    		if(nm == 0) continue;
    		if(str[nm].n == 0) {
    			str[nm].n = i;
    			str[nm].m = j;
			}
		}
	}
	for(int i = 1; i <= num; ++i) {
		int op = 0;
		for(int j = 1; j <= n; ++j) {
			for(int k = 1; k <= m; ++k) {		
				if(vis[j][k] != i && e[j][k] == 1) {
                    clear(str[i].n, str[i].m);
					opt = 1;
					cmp(str[i].n, str[i].m, j, k);
					op = max(opt, op);
				}
			}
		}
		if(op == 0) {
			win[i] = 1;
		}
	}
	int ans = 0;
	for(int i = 1; i <= n; ++i) {
		for(int j = 1; j <= m; ++j) {
			if(win[vis[i][j]] == 1) ans += 1;
		}
	}
	cout << ans << endl;
}
int main() {
	//freopen("1.in", "r", stdin);
	T = read();
	for(int i = 1; i <= T; ++i) {
		for(int i = 1; i <= n; ++i) {
			for(int j = 1; j <= m; ++j) {
				e[i][j] = 0;
				vis[i][j] = 0;
				v[i][j] = 0;
			}
		}
		for(int i = 1; i <= num; ++i) {
			win[i] = 0;
			str[i] = {0, 0};
		}
		n = read();
		m = read();
		for(int i = 1; i <= n; ++i) {
			for(int j = 1; j <= m; ++j) {
				cin >> ch;
				if(ch == '.') e[i][j] = 1;
			}
		}
		Solve();
    }
}