#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
#define TIME (clock() * 1.0 / CLOCKS_PER_SEC)

const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {-1, 0, 1, 0};
const int M = 4010;

int n, m;
vector<string> s;
vector<vector<bool>> used;
vector<pair<int, int>> comp;

void dfs(int x, int y) {
    comp.emplace_back(x, y);
    used[x][y] = true;
    for (int d = 0; d < 4; d++) {
        int nx = x + dx[d];
        int ny = y + dy[d];
        if (nx < 0 || nx >= n || ny < 0 || ny >= m) {
            continue;
        }
        if (s[nx][ny] == 'O') {
            continue;
        }
        if (!used[nx][ny]) {
            dfs(nx, ny);
        }
    }
}

void solve() {
    cin >> n >> m;
    s.resize(n);
    used.assign(n, vector<bool>(m, false));
    for (int i = 0; i < n; i++) {
        cin >> s[i];
    }
    vector<bitset<M>> kang;
    vector<int> sz;
    for (int x = 0; x < n; x++) {
        for (int y = 0; y < m; y++) {
            if (!used[x][y] && s[x][y] == '.') {
                comp.clear();
                dfs(x, y);
                for (auto [i, j] : comp) {
                    bitset<M> bt = 0;
                    for (auto [tx, ty] : comp) {
                        int idx = (tx - i + n - 1) * (2 * m) + (ty - j + m - 1);
                        bt[idx] = true;
                    }
                    kang.emplace_back(bt);
                    sz.emplace_back(comp.size());
                }
            }
        }
    }
    int ans = 0;
    for (int p = 0; p < (int)kang.size(); p++) {
        bool ok = true;
        for (int q = 0; q < (int)kang.size(); q++) {
            if (p == q || sz[q] < sz[p]) {
                continue;
            }
            if ((kang[q] & kang[p]) == kang[p]) {
                ok = false;
                break;
            }
        }
        if (ok) {
            ans++;
        }
    }
    cout << ans << "\n";
}

int main() {
#ifdef ONPC
    freopen("input", "r", stdin);
#endif
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}