#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define pb push_back
#define x first
#define y second 
#define endl '\n'
const LL maxn = 4e05+7;
const LL N = 5e05+10;
const LL mod = 1e09+7;
const int inf = 0x3f3f;
const LL llinf = 5e18;
typedef pair<int,int>pl;
priority_queue<LL , vector<LL>, greater<LL> >mi;//小根堆
priority_queue<LL> ma;//大根堆
LL gcd(LL a, LL b){
	return b > 0 ? gcd(b , a % b) : a;
}

LL lcm(LL a , LL b){
	return a / gcd(a , b) * b;
}
int n , m;
int a[N];
void init(int n){
	for(int i = 0 ; i <= n ; i ++){
		a[i] = 0;
	}
}
int tx[4] = {0 , 0 , -1 , 1};
int ty[4] = {1 , -1 , 0 , 0};
void solve() 
{
	cin >> n >> m;
	set<pair<int,int>>k[n][m];
	int mp[n][m];
	char c;
	vector<pair<int,int>>km;
	for(int i = 0 ; i < n ; i ++){
		for(int j = 0 ; j < m ; j ++){
			cin >> c;
			if(c == '.'){
				mp[i][j] = 1;
				km.pb({i , j});
			}
			else{
				mp[i][j] = 0;
			}
		}
	}
	for(int i = 0 ; i < n ; i ++){
		for(int j = 0 ; j < m ; j++){
			for(int x = 0 ; x < n ; x ++){
				for(int y = 0 ; y < m ; y ++){
					if(mp[x][y] == 0){
						k[i][j].insert({x - i, y - j});
					}
				}
			}
		}
	}
	int viss[n][m];
	int vis[n][m];
	int ans = 0;
	int tot = km.size();
	auto check = [&](int x , int y){
		return (x >= 0 && x < n && y >= 0 && y < m );
	};
	for(int i = 0 ; i < n ; i ++){
		for(int j = 0 ; j < m ; j ++){
			int f = 0;
		//	cout << i << "  " << j <<"::::"<< endl;
			if(mp[i][j] == 1){
				memset(vis , 0 , sizeof vis);
				memset(viss , 0 , sizeof viss);
				int cnt = tot; 
				queue<pair<int,int>>q;
				q.push({i , j});
				while(!q.empty()){
					pair<int,int>tmp = q.front();
					q.pop();
					int xx = tmp.first , yy = tmp.second;
					viss[xx][yy] = 1;
					int movex = xx - i , movey = yy - j;
				//	cout << xx << " " << yy <<endl;
					for(auto it : km){
						int nx = it.first;
						int ny = it.second;
							if(!vis[nx][ny] && (!check(nx + movex , ny + movey) || k[nx][ny].count({movex , movey}))){
							vis[nx][ny] = 1;
							cnt--;
						}
					}
				//	cout << cnt << endl;
					if(f == 0 && cnt == 1){
						f = 1;
						ans++;
					}
					for(int i = 0 ; i < 4 ; i ++){
						int nx = xx + tx[i];
						int ny = yy + ty[i];
						if(check(nx , ny) && viss[nx][ny] == 0 && mp[nx][ny] == 1){
							q.push({nx,ny});
							viss[nx][ny] = 1;
						}
					}
				}
				
			}
		}
	}
	cout << ans << endl;
}            
int main() 
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cout.precision(10);
    int t=1;
	cin>>t;
    while(t--)
    {
    	solve();
    }
    return 0;
}