#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


constexpr int DX[4] = {+1, 0, -1, 0};
constexpr int DY[4] = {0, +1, 0, -1};

char buf[1010];

int M, N;
vector<string> A;

int main() {
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    scanf("%d%d", &M, &N);
    A.resize(M);
    for (int x = 0; x < M; ++x) {
      scanf("%s", buf);
      A[x] = buf;
    }
    
    int U = 0;
    vector<vector<int>> ids(M, vector<int>(N, -1));
    for (int x = 0; x < M; ++x) for (int y = 0; y < N; ++y) if (A[x][y] == '.') {
      ids[x][y] = U++;
    }
    vector<vector<int>> F(U, vector<int>(4, -1));
    for (int x = 0; x < M; ++x) for (int y = 0; y < N; ++y) if (A[x][y] == '.') {
      const int u = ids[x][y];
      for (int dir = 0; dir < 4; ++dir) {
        const int xx = x + DX[dir];
        const int yy = y + DY[dir];
        if (0 <= xx && xx < M && 0 <= yy && yy < N && A[xx][yy] == '.') {
          F[u][dir] = ids[xx][yy];
        }
      }
    }
    
    auto encode = [&](int u, int v) -> int {
      return u * U + v;
    };
    const int win = U * U;
    vector<vector<int>> graph(U * U + 1);
    for (int u = 0; u < U; ++u) for (int v = 0; v < U; ++v) {
      for (int dir = 0; dir < 4; ++dir) {
        const int uu = F[u][dir];
        const int vv = F[v][dir];
        if (~uu) {
          graph[(~vv) ? encode(uu, vv) : win].push_back(encode(u, v));
        }
      }
    }
    queue<int> que;
    vector<int> vis(U * U + 1, 0);
    vis[win] = 1;
    que.push(win);
    for (; que.size(); ) {
      const int x = que.front();
      que.pop();
      for (const int y : graph[x]) {
        if (!vis[y]) {
          vis[y] = 1;
          que.push(y);
        }
      }
    }
    
    int ans = 0;
    for (int u = 0; u < U; ++u) {
      bool ok = true;
      for (int v = 0; v < U; ++v) if (u != v) {
        ok = ok && vis[encode(u, v)];
      }
      if (ok) {
        ++ans;
      }
    }
    printf("%d\n", ans);
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}