#include <bits/stdc++.h>
// #define int long long
#define inf 0x3f3f3f3f
#define ll long long
#define pii pair<int, int>
#define tii tuple<int, int, int>
#define db double
#define all(a) a.begin(), a.end()
using namespace std;
const int maxn = 1e3 + 10;
const int mod = 998244353;
char ch[maxn][maxn];
vector<pii> pos;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int vis[maxn * maxn], mp[maxn * maxn];
int n, m;
// 把状态 (i, j, r, c) 映射成一个整数
int encode(int i, int j, int r, int c) {
    return i * m * n * m + j * n * m + r * m + c;
}
// 把整数 msk 映射回状态 (i, j, r, c)
void decode(int msk, int& i, int& j, int& r, int& c) {
    i = msk / (m * n * m);
    j = msk / (n * m) % m;
    r = msk / m % n;
    c = msk % m;
}
int bfs(int x11, int y11, int x22, int y22) {
    int now = encode(x11, y11, x22, y22);
    if (vis[now]) return mp[now];
    queue<int> q;
    vector<int> vec;
    vis[now] = 1;
    q.push(now);
    int flag = 0;
    while (!q.empty()) {
        int now = q.front();
        int x1, y1, x2, y2;
        decode(now, x1, y1, x2, y2);
        q.pop();
        for (int i = 0; i < 4; i++) {
            int xx1 = x1 + dx[i], yy1 = y1 + dy[i];
            int xx2 = x2 + dx[i], yy2 = y2 + dy[i];
            int nxt = encode(xx1, yy1, xx2, yy2);
            if (xx1 < 0 || xx1 >= n | yy1 < 0 || yy1 >= m || ch[xx1][yy1] == 'O') continue;
            if (xx2 < 0 || xx2 >= n || yy2 < 0 || yy2 >= m || ch[xx2][yy2] == 'O') {
                flag = 1;
                continue;
            } else {
                if (!vis[nxt]) {
                    vis[nxt] = 1;
                    q.push(nxt);
                    vec.push_back(nxt);
                }
            }
        }
    }
    while (!vec.empty()) {
        auto it = vec.back();
        vec.pop_back();
        mp[it] = flag;
    }
    return flag;
}
int z;
int ck(int id) {
    z = id;
    int flag2 = 1;
    for (int i = 0; i < pos.size() && flag2; i++)
        if (i != id) {
            flag2 &= bfs(pos[id].first, pos[id].second, pos[i].first, pos[i].second);
        }
    return flag2;
}
void solve() {
    pos.clear();
    cin >> n >> m;
    for (int i = 0; i <= n * n * m * m + 2; i++)
        vis[i] = mp[i] = 0;
    int tot = 0;
    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++) {
            cin >> ch[i][j];
            if (ch[i][j] == '.') {
                tot++;
                pos.emplace_back(i, j);
            }
        }
    int ans = 0;
    for (int i = 0; i < pos.size(); i++) {
        if (i == 5)
            int debug = 0;
        // if (ck(i)) {
        //     cout << pos[i].first << " " << pos[i].second << "\n";
        // }
        ans += ck(i);
    }
    cout << ans << "\n";
}
signed main() {
    // freopen("1.in", "r", stdin);
    // freopen("1.out", "w", stdout);
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int t = 1;
    cin >> t;
    while (t--)
        solve();
    return 0;
}