#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
	int T; cin >> T;
	for(int t = 0; t < T; t++) {
		int N,M; cin >> N >> M;
		vector<vector<bool>> A(N, vector<bool>(M,false));
		for(int i = 0; i < N; i++) {
			for(int j = 0; j < M;  j++) {
				char c;
				cin >> c;
				A[i][j] = (int)(c != '.');
			}
		}


		vector<vector<bool>> F(N, vector<bool>(M,false));


		#define IS_BAD(a,b) ((a<0)||(a>=N)||(b<0)||(b>=M)||(A[a][b]))

		ll R = 0;
		for(int i = 0; i < N; i++) {
			for(int j = 0; j < M; j++) {
				set<pair<ll,ll>> cp;
				vector<pair<ll,ll>> vq = {{i,j}};
				while(vq.size()) {
					ll vi = vq.back().first, vj = vq.back().second; vq.pop_back();
					if(IS_BAD(vi,vj)) continue;
					if(F[vi][vj]) continue;
					F[vi][vj] = true;
					cp.insert({vi,vj});
					vq.push_back({vi+1,vj});
					vq.push_back({vi-1,vj});
					vq.push_back({vi,vj+1});
					vq.push_back({vi,vj-1});
				}


				if(cp.size() != 0) {
					vector<pair<ll,ll>> O;
					for(int i2 = 0; i2 < N; i2++) for(int j2 = 0; j2 < M; j2++) if(!A[i2][j2] && cp.find({i2,j2}) == cp.end()) O.push_back({i2,j2});

					for(auto x: cp) {
						vector<pair<ll,ll>> O2;
						for(auto y: O) if(!IS_BAD(y.first + x.first-i, y.second+x.second-j)) O2.push_back(y);
						O=O2;
					}
					if(!O.size()) R+=cp.size();
				}
			}
		}

		cout << R << endl;

	}
}