#include <bits/stdc++.h>

using namespace std;

using i64 = long long;

constexpr int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};
void solve(){
    int n, m;
    cin >> n >> m;
    vector<string>s(n);
    for (int i = 0;i < n;i ++){
        cin >> s[i];
    }

    auto ok = [&](int x, int y){
        if (x >= 0 and x < n and y >= 0 and y < m and s[x][y] == '.') return true;
        return false;
    };

    int ans = 0;
    vector vis(n, vector<int>(m));
    for (int i = 0;i < n;i ++){
        for (int j = 0;j < m;j ++){
            if (s[i][j] == '.' and !vis[i][j]){
                vector<pair<int, int>>path;
                auto dfs = [&](auto self, int x, int y) -> void{
                    vis[x][y] = 1;
                    path.push_back({x - i, y - j});
                    for (int k = 0;k < 4;k ++){
                        int a = x + dx[k], b = y + dy[k];
                        if (ok(a, b)){
                            if (!vis[a][b]){
                                self(self, a, b);
                            }
                        }
                    }
                };dfs(dfs, i, j);
                bool Y = false;
                for (int a = 0;a < n;a ++){
                    for (int b = 0;b < m;b ++){
                        if (a == i and b == j) continue;
                        Y = true;
                        for (auto [dx1, dy1] : path){
                            if (!ok(a + dx1, b + dy1)){
                                Y = false;
                                break;
                            }
                        }
                        if (Y) break;
                    }
                    if (Y) break;
                }
                if (!Y){
                    ans += path.size();
                }
            }
        }
    }
    cout << ans << "\n";
}

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

    int T;
    cin >> T;
    while (T --){
        solve();
    }

    return 0;
}