#include <bits/stdc++.h>

#define rep(i, l, r) for(int i = l; i <= r; i++)
#define per(i, l, r) for(int i = r; i >= l; i--)

using namespace std;

const int N = 1005;

int n, m, a[N][N];

int col[N][N], bel;

bitset<N * 8> s[N][N], c;

int get(int x, int y) {
	return (x + n + 1) * 3 * m + y;
}

void dfs(int x, int y) {
	if(col[x][y]) {
		return;
	}
	
	col[x][y] = bel;
	
	if(x != 1 && !a[x - 1][y]) {
		dfs(x - 1, y);
	}
	
	if(x != n && !a[x + 1][y]) {
		dfs(x + 1, y);
	}
	
	if(y != 1 && !a[x][y - 1]) {
		dfs(x, y - 1);
	}
	
	if(y != m && !a[x][y + 1]) {
		dfs(x, y + 1);
	}
}

int main() {
	int T;
	cin >> T;
	
	while(T--) {
		cin >> n >> m;
		
		rep(i, 1, n) {
			rep(j, 1, m) {
				char x;
				cin >> x;
				a[i][j] = (x == 'O');
			}
		}
		
		rep(i, -n, n * 2) {
			rep(j, -m + 1, m * 2) {
				c[get(i, j)] = (i >= n + 1 || i <= 0 ? 1 : (j <= m && j >= 1 ? a[i][j] : 1));
			}
		}
		
		rep(i, 1, n) {
			rep(j, 1, m) {
				if(!a[i][j]) {
					s[i][j] = c;
				}
			}
		}
		
		rep(i, 1, n) {
			rep(j, 1, m) {
				if(!a[i][j]) {
					bel++;
					dfs(i, j);
				}
			}
		}
		
		rep(i, 1, n) {
			rep(j, 1, m) {
				if(!a[i][j]) {
					rep(k, 1, n) {
						rep(t, 1, m) {
							if(col[i][j] == col[k][t]) {
								s[i][j] |= (i <= k ? 
									((j <= t ? (c >> (t - j)) : (c << (j - t))) >> ((k - i) * m * 3)) : 
									((j <= t ? (c >> (t - j)) : (c << (j - t))) << ((i - k) * m * 3)));
							}
						}
					}
				}
			}
		}
		
		int ans = 0;
		
		rep(i, 1, n) {
			rep(j, 1, m) {
				if(!a[i][j]) {
					int sum = 0;
					
					rep(k, 1, n) {
						rep(t, 1, m) {
							if(k == i && t == j) {
								continue;
							}
							
							sum += s[i][j][get(k, t)];
							
//							cout << i << " " << j << " " << k << " " << t << " " << s[i][j][get(k, t)] << '\n';
						}
					}
					
//					cout << i << " " << j << " " << sum << '\n';
					
//					assert(s[i][j][get(i,j)] == 0);
					
					if(sum == n * m - 1) {
						ans++;
					}
				}
			}
		}
		
		cout << ans << '\n';
	}
	
	return 0;
}