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

namespace IO {
	#if ONLINE_JUDGE
	#define getc() (IS == IT && (IT = (IS = ibuf) + fread(ibuf, 1, IL, stdin), IS == IT) ? EOF : *IS++)
	#else
	#define getc() getchar()
	#endif
	const int IL = 1 << 21, OL = 1 << 21;
	int olen = 0;
	char ibuf[IL], *IS = ibuf, *IT = ibuf, obuf[OL];
	inline int read() {
		register char ch = getc(); register int x = 0, f = 1;
		while(!isdigit(ch)) { if(ch == '-') f = -1; ch = getc(); }
		while(isdigit(ch)) x = x * 10 + ch - 48, ch = getc();
		return x * f;
	}
	inline double readdb() {
		register char ch = getc(); register double x = 0, f = 1;
		while(!isdigit(ch)) { if(ch == '-') f = -1; ch = getc(); }
		while(isdigit(ch)) x = x * 10 + ch - 48, ch = getc();
		if(ch == '.') {
			register double b = 0.1;
			ch = getc();
			while(isdigit(ch)) x += (ch - 48) * b, b *= 0.1, ch = getc();
		}
		return x * f;
	}
	inline int readstr(char *s) {
		register char ch = getc(); register int len = 0;
		while(ch != '.' && ch != 'O') ch = getc();
		while(ch == '.' || ch == 'O') s[++len] = ch, ch = getc();
		return len;
	}
	inline void flush() { fwrite(obuf, 1, olen, stdout); olen = 0; }
	inline void putc(register char ch) { obuf[olen++] = ch; }
	template<class T>
	inline void write(register T x) {
		if(x < 0) obuf[olen++] = '-', x = -x;
		if(x > 9) write(x / 10);
		obuf[olen++] = x % 10 + 48;
	}
} using namespace IO;
const int N = 1e3 + 10, kx[] = {0, 0, 1, -1}, ky[] = {1, -1, 0, 0};
int T, n, m;
vector<char> ch[N];
char s[N];
namespace ufs {
	int fa[N];
	int find(int x) { return fa[x] == x ? x : fa[x] = find(fa[x]); }
} using namespace ufs;
vector<int> id[N];
bitset<N> bs[N << 1][N << 1], t;
void MAIN() {
	n = read(), m = read();
	for(int i = 0; i <= n; i++)
		for(int j = 0; j <= m; j++)
			bs[n + i][m + j].reset(), bs[n - i][m - j].reset();
	for(int i = 1; i <= n; i++) {
		ch[i].resize(m + 5);
		id[i].resize(m + 5);
		readstr(s);
		for(int j = 1; j <= m; j++)
			ch[i][j] = s[j];
	}
	for(int i = 1; i <= n; i++) {
		id[i].resize(m + 5);
		for(int j = 1; j <= m; j++)
			id[i][j] = (i - 1) * m + j;
	}
	for(int i = 1; i <= n * m; i++) fa[i] = i; 
	int cnt = 0;
	for(int i = 1; i <= n; i++)
		for(int j = 1; j <= m; j++) {
			if(ch[i][j] == 'O') continue;
			cnt++;
			for(int k = 0; k < 4; k++) {
				int dx = i + kx[k], dy = j + ky[k];
				if(dx > 0 && dx <= n && dy > 0 && dy <= m && ch[dx][dy] != 'O') {
					int x = find(id[i][j]), y = find(id[dx][dy]);
					if(x != y) fa[x] = y; 
				}
			}
		}
	for(int i = 0; i <= n + 1; i++)
		for(int j = 0; j <= m + 1; j++) {
			if(!i || i == n + 1 || !j || j == m + 1) {
//				if(i == 2 && j == 6) puts("TT");
				for(int k = 1; k <= n; k++)
					for(int l = 1; l <= m; l++)
						if(ch[k][l] == '.') bs[n + i - k][m + j - l][id[k][l]] = 1;
			}
		}
	for(int i = 1; i <= n; i++)
		for(int j = 1; j <= m; j++) {
			if(ch[i][j] == 'O') continue;
			for(int k = 1; k <= n; k++)	
				for(int l = 1; l <= m; l++) {
					if(ch[k][l] != 'O') continue;
					bs[n + k - i][m + l - j][id[i][j]] = 1;
				}
		}
//	for(int i = -n; i <= n; i++)
//		for(int j = -n; j <= n; j++) {
//			printf("%d %d\n", i, j);
//			int x = 0;
//			while((x = bs[n + i][m + j]._Find_next(x)) <= n * m) {
//				printf("%d %d\n", (x - 1) / m + 1, (x - 1) % m + 1); 
//			}
//			puts("");
//		}
	int ans = 0;
	for(int i = 1; i <= n; i++)
		for(int j = 1; j <= m; j++) {
			if(ch[i][j] == 'O') continue;
			t.reset();
			for(int i1 = 1; i1 <= n; i1++)
				for(int j1 = 1; j1 <= m; j1++) {
					if(ch[i1][j1] == 'O') continue;
					if(find(id[i][j]) == find(id[i1][j1])) {
						t |= bs[n + i1 - i][m + j1 - j];
					}
				}
			ans += t.count() == cnt - 1;
		}
	printf("%d\n", ans);
}
int main() {
	T = read();
	while(T--) MAIN();
	return 0;
}