#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a, i##_ = b; i < i##_; ++i)

using namespace std;
using ll = int64_t;
const int N = 1e3 + 5;
const int dx[] = {0, 0, -1, 1}, dy[] = {1, -1, 0, 0};
int n, m; char s[N][N];
void Solve() {
    scanf("%d%d", &n, &m);
    int cnt = 0, ans = 0;
    vector<set<pair<int, int>>> st;
    vector id(n, vector<int>(m, -1));
    rep(i, 0, n) scanf("%s", s[i]);
    rep(i, 0, n) rep(j, 0, m)
        if (s[i][j] == '.' && id[i][j] == -1) {
            id[i][j] = cnt;
            st.push_back({});
            queue<pair<int, int>> q;
            q.push({i, j});
            while (!q.empty()) {
                auto [x, y] = q.front(); q.pop();
                st.back().insert({x, y});
                rep(k, 0, 4) {
                    int u = x + dx[k], v = y + dy[k];
                    if (0 <= u && u < n && 0 <= v && v < m && s[u][v] == '.' && id[u][v] == -1)
                        id[u][v] = cnt, q.push({u, v});
                }
            }
            cnt++;
        }
    rep(k, 0, st.size()) {
        auto &ps = st[k];
        auto [u, v] = *ps.begin();
        rep(i, 0, n) rep(j, 0, m)
            if (id[i][j] != -1 && id[i][j] != k) {
                int t = id[i][j], r = 0;
                for (auto [x, y] : ps)
                    if (!st[t].count({x - u + i, y - v + j})) {
                        r = 1; break;
                    }
                if (!r) goto bad;
            }
        ans += ps.size();
bad:;
    }
    printf("%d\n", ans);
}
int main() {
    int t = 1;
    scanf("%d", &t);
    while (t--) Solve();
    return 0;
}