#include <bits/stdc++.h>
#define pii pair<int, int>
using namespace std;

const int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, -1, 0, 1};
int T, n, m, vis[1001][1001];
char a[1001][1001];
vector<pii> d;
bitset<4001> b[1001];
int top;

inline int p(int x, int y) { return (x + n - 1) * (m + m - 1) + (y + m - 1); }

inline bool ck(int x, int y) { return (x >= 1 && y >= 1 && x <= n && y <= m && a[x][y] == '.'); }

void dfs(int x, int y, int DX, int DY) {
    vis[x][y] = 1;
    d.push_back({DX, DY});
    for (int i = 0; i < 4; ++i) {
        int tox = dx[i] + x, toy = dy[i] + y;
        if (ck(tox, toy) && !vis[tox][toy]) dfs(tox, toy, DX + dx[i], DY + dy[i]);
    }
}

int main() {
    ios::sync_with_stdio(false); cin.tie(0);
    cin >> T;
    while (T--) {
        cin >> n >> m;
        for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) cin >> a[i][j];
        int ans = 0; top = 0;
        for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) if (a[i][j] == '.') {
            d.clear();
            memset(vis, 0, sizeof(vis));
            dfs(i, j, 0, 0);
            ++top;
            b[top].reset();
            for (auto now : d) b[top][p(now.first, now.second)] = 1;
        }
        for (int i = 1; i <= top; ++i) {
            bool unique = true;
            for (int j = 1; j <= top; ++j) if (i != j && (b[i] & b[j]) == b[i]) unique = false;
            ans += unique;
        }
        cout << ans << '\n';
    }
    return 0;
}