#include <bits/stdc++.h>
//#define int long long
#define endl "\n"
using namespace std;

using ll = long long;
const int dx[4] = {0, 0, 1, -1};
const int dy[4] = {1, -1, 0, 0}; 

void solve() {
    int n, m;
    cin >> n >> m;
    vector<string> grid(n);
    for (auto& s : grid) {
        cin >> s;
    }

    auto invalid = [&](int x, int y) -> bool {
        return x < 0 || x >= n || y < 0 || y >= m;
    };

    auto bfs = [&](int ex, int ey) -> set<pair<int, int>> {
        set<pair<int, int>> cor;
        queue<pair<int, int>> q;
        q.emplace(ex, ey);
        while (!q.empty()) {
            auto [x, y] = q.front(); q.pop();
            cor.emplace(x - ex, y - ey);
            for (int i = 0; i < 4; i++) {
                int xx = x + dx[i];
                int yy = y + dy[i];
                if (invalid(xx, yy) || grid[xx][yy] != '.')
                    continue;
                q.emplace(xx, yy);
                grid[xx][yy] = '*';
            }
        }
        return cor;
    };

    vector<set<pair<int, int>>> space;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (grid[i][j] == '.')
                space.emplace_back(bfs(i, j));
        }
    }

    int ans = 0;
    for (int i = 0; i < space.size(); i++) {
        bool flag = true;
        for (int j = 0; j < space.size(); j++) {
            if (i == j)
                continue;
            int cnt = space[i].size();
            for (auto d : space[i]) {
                if (space[j].count(d)) {
                    cnt--;
                }
            }
            if (!cnt) {
                flag = false;
                break;
            }
        }
        ans += flag ? space[i].size() : 0;
    }
    cout << ans << endl;
}

int main() {
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);

    int T = 1;
    cin >> T;

    while (T--) {
        solve();
    }

    return 0;
}