#include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
#include <queue>

using namespace std;
#define endl '\n'
typedef long long LL;
typedef pair<int, int> PII;
const int N = 2e5 + 10;
const LL INFF = 0x3f3f3f3f3f3f3f3f;
const int INF = 0x3f3f3f3f,mod = 998244353;
#define debug(x) cout<< "[debug]" #x << " = " << x <<endl

int n, m;
int dx[5] = {1, -1, 0, 0};
int dy[5] = {0, 0, 1, -1};

void solve()
{
    cin >> n >> m;
    vector<vector<char>> c(n + 1, vector<char>(m + 1));
    for(int i = 1; i <= n; i++){
    	for(int j = 1; j <= m; j++){
    		cin >> c[i][j];
    	}
    }

    int ans = 0;
    vector<vector<int>> st(n + 1, vector<int>(m + 1));
    for(int i = 1; i <= n; i++){
    	for(int j = 1; j <= m; j++){
    		if(!st[i][j] && c[i][j] == '.'){
    			queue<PII> q1, q2;
    			vector<vector<int>> sw(n + 1, vector<int>(m + 1));

    			q1.push({i, j});
    			sw[i][j] = 1;
    			int cnt = 1;
    			while(q1.size()){
    				auto [x, y] = q1.front();
    				q1.pop();

    				for(int i = 0; i < 4; i++){
    					int tx = x + dx[i];
    					int ty = y + dy[i];
    					if(tx < 1 || tx > n || ty < 1 || ty > m)continue;
    					if(!sw[tx][ty] && c[tx][ty] == '.'){
    						sw[tx][ty] = 1;
    						q1.push({tx, ty});
    						cnt++;
    					}
    				}
    			}

    			q1.push({i, j});
    			for(int k = 1; k <= n; k++){
    				for(int l = 1; l <= m; l++){
    					if(c[k][l] == '.' && !sw[k][l])q2.push({k, l});
    				}
    			}

    			while(q1.size()){
    				auto [x, y] = q1.front();
    				q1.pop();

    				for(int i = 0; i < 4; i++){
    					int tx = x + dx[i];
    					int ty = y + dy[i];
    					if(tx < 1 || tx > n || ty < 1 || ty > m)continue;
    					if(!st[tx][ty] && c[tx][ty] == '.'){
    						st[tx][ty] = 1;
    						q1.push({tx, ty});

    						queue<PII> q3;

    						while(q2.size()){
    							auto [x, y] = q2.front();
    							q2.pop();

    							int tx = x + dx[i];
    							int ty = y + dy[i];
    							if(tx < 1 || tx > n || ty < 1 || ty > m)continue;
    							if(c[tx][ty] == '.')q3.push({tx, ty});
    						}
    						q2 = q3;
    						break;
    					}
    				}
    			}

    			if(!q2.size())ans += cnt;
    		}
    	}
    }

    cout << ans << endl;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int T = 1;
    cin >> T;
    while(T--)
    {
        solve();
    }
}