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

#define all(x) begin(x), end(x)
#ifdef CKISEKI
#define safe cerr << __PRETTY_FUNCTION__ << " line " << __LINE__ << " safe\n"
#define orange(a...) orange_(#a, a)
#define debug(a...) debug_(#a, a)
#include <experimental/iterator>
void debug_(auto s, auto ...a) {
  cerr << "\e[1;32m(" << s << ") = (";
  int f = 0;
  (..., (cerr << (f++ ? ", " : "") << a));
  cerr << ")\e[0m\n";
}
void orange_(auto s, auto L, auto R) {
  cerr << "\e[1;33m[ " << s << " ] = [ ";
  using namespace experimental;
  copy(L, R, make_ostream_joiner(cerr, ", "));
  cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define debug(...) safe
#define orange(...) safe
#endif

int vis[1000], visc;
bitset<4096> ok[1000];

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int t;
  cin >> t;
  while (t--) {
    int n, m;
    cin >> n >> m;
    vector<string> a(n);
    for (auto &ai : a)
      cin >> ai;

    for (int i = 0; i < n * m; ++i)
      ok[i].reset();

    auto Enc = [m](int x, int y) {
      return x * m + y;
    };
    auto EncV = [n, m](int dx, int dy) {
      return (dx + n) * 2 * m + (dy + m);
    };

    for (int i = 0; i < n; ++i) {
      for (int j = 0; j < m; ++j) {
        if (a[i][j] == 'O')
          continue;
        visc += 1;
        queue<pair<int, int>> bfs;
        bfs.emplace(i, j);
        vis[Enc(i, j)] = visc;
        while (not bfs.empty()) {
          auto [x, y] = bfs.front();
          bfs.pop();

          ok[Enc(i, j)][EncV(x - i, y - j)] = true;

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

          for (int d = 0; d < 4; ++d) {
            int nx = x + dx[d], ny = y + dy[d];
            if (0 > nx or nx >= n)
              continue;            
            if (0 > ny or ny >= m)
              continue;
            if (vis[Enc(nx, ny)] == visc)
              continue;
            if (a[nx][ny] == 'O')
              continue;
            vis[Enc(nx, ny)] = visc;
            bfs.emplace(nx, ny);
          }
        }
      }
    }

    int ans = 0;
    for (int i = 0; i < n * m; ++i) {
      bool win = true;
      for (int j = 0; j < n * m; ++j) {
        if (i == j)
          continue;
        // ok[i] \in ok[j] -> i lose
        if ((ok[i] | ok[j]) == ok[j]) {
          win = false;
          break;
        }
      }
      ans += win;
    }
    cout << ans << '\n';
  }
  return 0;
}