#include <bits/stdc++.h>

const int MAXN = 1e3 + 10;

int n, m;
std::vector<std::string> A;
std::bitset<4010> fss[MAXN];
std::vector<std::vector<int>> ids, vis;

int DX[4] = {+1, 0, -1, 0};
int DY[4] = {0, +1, 0, -1};
int encode(int dx, int dy) {
    return (n - 1 + dx) * (2 * m - 1) + (m - 1 + dy);
}
void dfs(int u, int x0, int y0, int x, int y) {
    if(vis[x][y] != u) {
        vis[x][y] = u;
        fss[u].set(encode(x - x0, y - y0));
        for(int dirs = 0; dirs < 4; dirs++) {
            int xx = x + DX[dirs];
            int yy = y + DY[dirs];
            if(0 <= xx && xx < n && 0 <= yy && yy < m && A[xx][yy] == '.') {
                dfs(u, x0, y0, xx, yy);
            }
        }
    }
}
void solve() {
    std::cin >> n >> m;
    A.resize(n);
    for(int i = 0; i < n; i++) std::cin >> A[i];
    int u = 0;
    ids.assign(n, std::vector<int>(m, -1));
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            if(A[i][j] == '.') ids[i][j] = u++;
        }
    }
    vis.assign(n, std::vector<int>(m, -1));
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            if(A[i][j] == '.') {
                fss[ids[i][j]].reset();
                dfs(ids[i][j], i, j, i, j);
            }
        }
    }
    std::vector<std::pair<int, int>> cus(u);
    for(int i = 0; i < u; i++) {
        cus[i] = std::make_pair(fss[i].count(), i);
    }
    sort(cus.begin(), cus.end());
    int ans = 0;
    for(int i = 0; i < u; i++) {
        bool ok = true;
        for(int j = u - 1; j >= 0; j--) {
            if(cus[j].first < cus[i].first) break;
            int num1 = cus[i].second, num2 = cus[j].second;
            if(num1 != num2 && (fss[num1] & ~fss[num2]).none()) {
                ok = false;
                break;
            }
        }
        if(ok) ans++;
    }
    std::cout << ans << '\n';
}

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

    int T = 1;
    std::cin >> T;
    while(T--) solve();

    return 0;
}