#include<bits/stdc++.h>
#define fore(i,l,r)	for(int i=(int)(l);i<(int)(r);++i)
#define fi first
#define se second
#define endl '\n'
#define ull unsigned long long
#define ALL(v) v.begin(), v.end()
#define Debug(x, ed) std::cerr << #x << " = " << x << ed;

const int INF=0x3f3f3f3f;
const long long INFLL=1e18;

typedef long long ll;

const int N = 1005;

std::vector<std::pair<int, int>> mv = {{0, -1}, {0, 1}, {-1, 0}, {1, 0}};

int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);
    int t;
    std::cin >> t;
    while(t--){
        int n, m;
        std::cin >> n >> m;
        std::vector<std::string> mp(n + 1);
        std::vector<std::vector<std::vector<std::vector<bool>>>> vis(n + 1, 
            std::vector<std::vector<std::vector<bool>>>(m + 1, 
             std::vector<std::vector<bool>>(n + 1, std::vector<bool>(m + 1, false))));
        auto f = vis;
        fore(i, 1, n + 1){
            std::cin >> mp[i];
            mp[i] = '0' + mp[i];
        }

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

        auto dfs = [&](auto self, int x, int y, int s, int e) -> bool {
            if(!in(s, e)) return true;
            if(vis[x][y][s][e]) return f[x][y][s][e];
            vis[x][y][s][e] = true;
            if(mp[s][e] != '.') return f[x][y][s][e] = true;

            for(auto [dx, dy] : mv){
                int xx = x + dx, yy = y + dy;
                int ss = s + dx, ee = e + dy;
                if(in(xx, yy) && mp[xx][yy] == '.'){
                    if(self(self, xx, yy, ss, ee)) return f[x][y][s][e] = true;
                }
            }

            return false;
        };


        fore(x, 1, n + 1)
            fore(y, 1, m + 1)
                fore(s, 1, n + 1)
                    fore(e, 1, m + 1)
                        if(!vis[x][y][s][e])
                            dfs(dfs, x, y, s, e);
        
        int ans = 0;
        fore(x, 1, n + 1)
            fore(y, 1, m + 1){
                int cnt = 0;
                fore(s, 1, n + 1)
                    fore(e, 1, m + 1)
                        cnt += f[x][y][s][e];
                ans += (cnt == n * m - 1);
            }

        std::cout << ans << endl;
    }
    
    return 0;
}