#include <bits/stdc++.h>
#define endl '\n'
using namespace std;

int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
const int N = 1000;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);

  int z; cin >> z;
  while (z--) {
    int n, m; cin >> n >> m;
    vector<vector<int>> a(n, vector<int>(m)); 
    for (int i = 0; i < n; i++) {
      string s; cin >> s;
      for (int j = 0; j < m; j++) {
        if (s[j] == 'O') a[i][j] = 1;
        else a[i][j] = 0;
      } 
    }
    auto check = [&](int x, int y) {
      if (x < 0 || y < 0) return false;
      if (x >= n || y >= m) return false;
      if (a[x][y]) return false;
      return true;
    };

    vector<vector<bitset<N>>> b(n * 2 + 4, vector<bitset<N>>(m * 2 + 4));
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        b[i][j].reset();
      }
    }
    int basen = n; 
    int basem = m;
    vector<vector<vector<pair<int, int>>>> go(n, vector<vector<pair<int, int>>>(m));
    
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        if (a[i][j]) continue;
        int o = i * m + j;
        queue<pair<int, int>> que; que.emplace(i, j);  
        vector<vector<int>> vis(n, vector<int>(m, 0)); 
        while (que.empty() == false) {
          auto [px, py] = que.front(); que.pop();
          int posx = px - i + basen;
          int posy = py - j + basem;
          b[posx][posy][o] = 1; 
          go[i][j].emplace_back(posx, posy);
          for (int k = 0; k < 4; k++) {
            int nx = px + dx[k], ny = py + dy[k];
            if (check(nx, ny) == false) continue;
            if (vis[nx][ny]) continue; 
            vis[nx][ny] = 1;
            que.emplace(nx, ny);
          }
        } 
      }
    }

    bitset<N> temp;
    int cnt = 0;
    
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        if (a[i][j]) continue;
        temp.set(); 
        for (auto &[x, y] : go[i][j]) {
          temp = temp & b[x][y];  
        }
        if (temp.count() == 1) {
          assert(temp[i * m + j] == 1);
          cnt++;
        }
      }
    } 
    cout << cnt << endl;
  }

  return 0;
}