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

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, b, a) for(int i = (b) - 1; i >= (a); i--)
#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

const int N = 1'747;

int c[N][N];
set<PII> s[N];
int col;

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

int main()
{
	ios::sync_with_stdio(0); 
	cin.tie(0);
	cout << fixed << setprecision(15);
	
	int t;
	cin >> t;
	while (t--)
	{
		int n, m;
		cin >> n >> m;
		
		vector<string> v(n);
		FOR (i, 0, n)
			cin >> v[i];
		
		col = 0;
		vector<PII> hole;
		FOR (i, 0, n)
		{
			hole.PB({i, -1});
			hole.PB({i, m});
		}
		FOR (i, 0, m)
		{
			hole.PB({-1, i});
			hole.PB({n, i});
		}
		FOR (i, 0, n)
		{
			FOR (j, 0, m)
			{
				c[i][j] = -1;
				if (v[i][j] == 'O')
					hole.PB({i, j});
			}
		}	
		FOR (i, 0, n)
		{
			FOR (j, 0, m)
			{
				if (v[i][j] == 'O' || c[i][j] != -1)
					continue;
					
				vector<PII> g;
				c[i][j] = col;
				g.PB({i, j});
				int idx = 0;
				while (idx != SZ(g))
				{
					FOR (k, 0, 4)
					{
						int nx = g[idx].F + dx[k];
						int ny = g[idx].S + dy[k];
						if (nx >= 0 && ny >= 0 && nx < n && ny < m && v[nx][ny] != 'O' && c[nx][ny] == -1)
						{
							c[nx][ny] = col;
							g.PB({nx, ny});
						}
					}
					idx++;
				}
				FOR (k, 0, SZ(g))
				{
					FOR (l, 0, SZ(hole))
					{
						int x = g[k].F - hole[l].F;
						int y = g[k].S - hole[l].S;
						s[col].insert({x, y});
					}
				}
				col++;
			}
		}
		int ans = 0;
		FOR (i0, 0, n)
		{
			FOR (j0, 0, m)
			{
				if (v[i0][j0] == 'O')
					continue;
				bool ok = true;
				FOR (i1, 0, n)
				{
					FOR (j1, 0, m)
					{
						if (v[i1][j1] == 'O' || c[i0][j0] == c[i1][j1])
							continue;
						int x = i0 - i1;
						int y = j0 - j1;
						
						if (!s[c[i0][j0]].count({x, y}))
						{
							ok = false;
							break;
						}
					}
				}
				if (ok)
					ans++;
			}
		}
		FOR (i, 0, col)
			s[i].clear();
		col = 0;
		cout << ans << '\n';
	}
	
	
	return 0;
}