#include <cstdio>

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

int n, m, tot;
int a[N][N], f[N][N];
char s[N][N];
struct Node {
  int i, j, x, y;
} q[N];

inline int id(int x, int y) {
  return x * (m + 2) + y;
}

void solve() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; ++i) scanf("%s", s[i] + 1);
  for (int i = 0; i <= n + 1; ++i)
    for (int j = 0; j <= m + 1; ++j) {
      if (!i || !j || i > n || j > m) s[i][j] = 'O';
    }
  tot = (n + 2) * (m + 2);
  for (int i = 0; i < tot; ++i)
    for (int j = 0; j < tot; ++j) f[i][j] = 0;
  int h = 1, t = 0;
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= m; ++j) if (s[i][j] == '.') {
      for (int x = 0; x <= n + 1; ++x) {
        for (int y = 0; y <= m + 1; ++y) if (s[x][y] == 'O') {
          f[id(i, j)][id(x, y)] = 1;
          q[++t] = {i, j, x, y};
        }
      }
    }
  while (h <= t) {
    int i = q[h].i, j = q[h].j, x = q[h].x, y = q[h].y;
    h++;
    for (int k = 0; k < 4; ++k) {
      int ni = i + dx[k];
      int nj = j + dy[k];
      int nx = x + dx[k];
      int ny = y + dy[k];
      if (s[ni][nj] == '.' && !f[id(ni, nj)][id(nx, ny)]) {
        f[id(ni, nj)][id(nx, ny)] = 1; 
        q[++t] = {ni, nj, nx, ny};
      }
    }
  }
  int ans = 0;
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= m; ++j) if (s[i][j] == '.') {
      int fl = 1;
      for (int x = 0; x <= n + 1; ++x) {
        for (int y = 0; y <= m + 1; ++y) if (s[x][y] == '.') {
          if (x == i && y == j) continue;
          fl &= f[id(i, j)][id(x, y)];
          if (!fl) break;
        }
        if (!fl) break;
      }
      ans += fl;
    }
  printf("%d\n", ans);
}

int main() {
  int t;
  scanf("%d", &t);
  while (t--) solve();
  return 0;
}