#include <stdio.h>
#include <string.h>
#include <assert.h>

#include <vector>
#include <bitset>
#include <algorithm>

#define LOG(FMT...) fprintf(stderr, FMT)
#define eb emplace_back

using namespace std;

constexpr int N = 1024, dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};

int n, m;
char gr[N];
bitset<N> bst[N]; int cnt;
bool was[N];

void chk() {
	for (int i = 0; i < cnt; ++i) {
		if (was[i] && was[cnt]) {
			continue;
		}
		const bitset<N> &t = bst[i] & bst[cnt];
		if (!was[i] && t == bst[i]) {
			was[i] = true;
		}
		if (!was[cnt] && t == bst[cnt]) {
			was[cnt] = true;
		}
	}
}

int id(int x, int y) {
	x += n - 1;
	y += m - 1;
	return x * (2 * m - 1) + y;
}

int q[N], hh, tt;

void bfs(int sx, int sy, bitset<N> &vis) {
	vis.reset();
	// LOG("%d %d\n", sx, sy);
	hh = tt = 0, *q = sx * m + sy;
	vis.set(id(0, 0));
	while (hh <= tt) {
		int s = q[hh++], x = s / m, y = s % m;
		for (int d = 0; d < 4; ++d) {
			int tx = x + dx[d], ty = y + dy[d];
			int t = tx * m + ty;
			int k = id(tx - sx, ty - sy);
			if (tx < 0 || tx >= n || ty < 0 || ty >= m || !gr[t] || vis.test(k)) {
				continue;
			}
			vis.set(k);
			q[++tt] = t;
		}
	}
}

int main() {
	int task;
	for (scanf("%d", &task); task--; ) {
		scanf("%d%d", &n, &m);
		cnt = 0;
		for (int i = 0; i < n; ++i) {
			scanf("%s", gr + i * m);
		}
		for (int i = 0; i < n * m; ++i) {
			gr[i] = (gr[i] == '.');
		}
		for (int x = 0; x < n; ++x) {
			for (int y = 0; y < m; ++y) {
				if (gr[x * m + y]) {
					bfs(x, y, bst[cnt]);
					was[cnt] = false;
					chk();
					cnt += 1;
				}
			}
		}
		int res = 0;
		for (int i = 0; i < cnt; ++i) {
			res += !was[i];
		}
		printf("%d\n", res);
	}
	return 0;
}