#include<bits/stdc++.h>

#define vc vector
#define pb emplace_back
#define pii pair<int, int>
#define mkp make_pair
#define rep(i, a, b) for(int i = (a); i <= (b); ++i)
#define lep(i, a, b) for(int i = (a); i >= (b); --i)

using namespace std;

inline int read() {
	int x = 0, w = 0; char ch = getchar(); while(!isdigit(ch)) w |= (ch == '-'), ch = getchar();
	while(isdigit(ch)) x = x * 10 + (ch ^ 48), ch = getchar(); return w ? -x : x; 
}

const int N = 1005;
const int dx[5] = {0, 1, -1, 0, 0}, dy[5] = {0, 0, 0, 1, -1};

int n, m, ans, vis[N][N], b[N][N];
char a[N][N];

inline int ok(int x, int y) { return x > 0 && x <= n && y > 0 && y <= m && a[x][y] == '.'; }

inline void bfs(int sx, int sy) {
	rep(i, 1, n) rep(j, 1, m) b[i][j] = ok(i, j); b[sx][sy] = 0;
	queue<pii> Q; Q.push(mkp(sx, sy)); vis[sx][sy] = 1; 
	int tot = 0, fl = 1;
	while(!Q.empty()) {
		auto [x, y] = Q.front(); Q.pop(); ++tot;
		int dx = x - sx, dy = y - sy;
		rep(i, 1, n) rep(j, 1, m) b[i][j] &= ok(i + dx, j + dy);
		for(int i = 0, nx, ny; i < 4; i++) 
			if(ok(nx = x + ::dx[i], ny = y + ::dy[i]) && !vis[nx][ny])
				vis[nx][ny] = 1, Q.push(mkp(nx, ny));
	}
	rep(i, 1, n) rep(j, 1, m) fl &= (!b[i][j]);
	ans += fl * tot;
}

inline void testcase() {
	n = read(); m = read(); ans = 0;
	rep(i, 1, n) scanf("%s", a[i] + 1);
	
	rep(i, 1, n) rep(j, 1, m) vis[i][j] = 0;
	rep(i, 1, n) rep(j, 1, m) if(!vis[i][j] && ok(i, j)) bfs(i, j);
	
	printf("%d\n", ans);
}

signed main() {
	int t = read(); while(t--) testcase(); 
	return 0;
}